Phone Interview:

• https://leetcode.com/problems/valid-parentheses/
• https://leetcode.com/problems/clone-graph/

Onsite Interview:

Round 1: Problem Solving (1 hour)

• https://leetcode.com/problems/maximum-width-of-binary-tree/
• https://www.geeksforgeeks.org/maximum-sum-path-across-two-arrays/

Round 2: System Design (1 hour)

• Design Instagram

Round 3:

• Lunch with hiring manager with some behavioral questions. (1 hour)

Round 4: Problem Solving (1 hour)

• https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/
• https://leetcode.com/problems/group-anagrams/

Round 5: Problem Solving (1 hour)

• https://leetcode.com/problems/lru-cache/ (implement it using LinkedList)
• In a N-ary tree, each node consists of a 2 values X and Y and a list of child nodes. Write a method “boolean find (Node root, int X, int Y)” such that X and Y exists in a tree on the same level but not in the same node.
• https://leetcode.com/problems/copy-list-with-random-pointer/ (implement it in O(N) with no extra space)