1. Online Assessment
2. Code Pair Round
   1. Binary Search
   2. Delete a Node in Linked List
3. Onsite (5 Rounds + Lunch) (1 Hour Each)
   Each Round 30 mins Behavioural + 30 mins coding/system design
   4 Rounds (3coding + 1 System Design)
   1 Round with Hiring Manager (Previous Projects)

Problems:
1. Build Order (Topological Sort)
`Given Input
{
'A': ['B', 'C'],
'B': ['D'],
'C' :[],
'D': ['H'],
'E': ['A', 'F'],
'F' :['I'],
'G': ['B'],
'H': [],
'I': []
}'

  Expected Output (The Order can change if there are no dependencys to build)		
  // I -> H -> C -> D -> B -> G -> F -> A -> E 

2. https://leetcode.com/problems/number-of-islands/
3. https://leetcode.com/problems/trapping-rain-water/
4. https://leetcode.com/problems/lru-cache/