Written Test: It is a hackerrank based written test.
- They have given an array and asked to sort based on a specific condition. We need to slightly modify the partition method of a quick sort and implement the solution
- It is a slight variation of the standard LCS problem
Round 1:
- Given a binary tree and a sum x. Find whether any two elements belonging to a different level in a binary tree adds to the given sum x.
- Find the next greater element in array.
Round 2:
- Find the number of distinct islands in a matrix.
- Clone a binary tree that has left, right and random pointer in each node.
- LRU cache implementation.
Status: selected