1. Number of subarrays having sum less than K
2. Maximize elements using another array
3. Number of ones in the smallest repunit
4. Element which occurs consecutively in a given subarray more than or equal to K times
5. Maximize the sum of X+Y elements by picking X and Y elements from 1st and 2nd array