Format: 3 coding questions
Platform: HackerEarth
Time: 90 mins

1. Find no. of ways to divide array A of size N into two subsets such that sum of each subset is greater than K. Constraints: 1 <= N <= 10^3, 1 <= K <= 10^5, 1 <= A[i] <= 10^9 (return answer modulo 10^9 + 7)
2. Given two strings S and T, return if it is possible to transform S into T by applying the following operation any number of times:
   Map a character of S to a character in T and replace all occurences of that character in S
   Note: Each character can be mapped to only one other character, however it may be mapped to itself.
3. Non-negative integers without consecutive 1's in their binary representation