1. Count of alphabets whose ASCII values can be formed with the digits of N
2. Array Manipulation and Sum
3. Time until distance gets equal to X between two objects moving in opposite direction
4. Maximize the median of the given array after adding K elements to the same array
5. Check if it is possible to redistribute the Array
6. Count of non-overlapping sub-strings "101" and "010" in the given binary string
7. Minimum operations required to convert a binary string to all 0s or all 1s
8. Find the count of subsequences where each element is divisible by K
9. Repeated sum of first N natural numbers
10. Minimum sum obtained from groups of four elements from the given array