- First one was to check weather a valid BST exists given its pre-order traversal.
- Find maximum number of consercutive days when all the emloyees were present. Matrix data was given. data[i ][j] denotes the jth employee’s attendance on ith day.
- Minimum number of moves required for knight to reach the ending position from given starting position.
- Find the longest subsequence of S that is palindrome.