Category
algorithm
Minimum One Bit Operations to Make Integers Zero
Given an array of integers, the problem is to find the minimum number of operations needed to make all the integers in the array 0 by performing only one bit operation (flipping one bit) at a time 
Sam and substrings
Given a string, the problem is to find the sum of all possible substrings of it