Phone Screen:\n\n1. LCA of 3 nodes disguised as first skip manager of 3 employees\n2. House robber tree variant(again disguised in other words)\n\nOnsite:\n\n5 rounds, 1 of them being bar-raiser\n\nBar-Raiser: Intense interrogation from best project. Traverse a graph to assert connectivity between two nodes, he was less interested in algo(bfs/bi-directional bfs), more in systems/scalability. Asked me to write proof(by induction) why bfs gives the shortest path.\n\nIntv 2: Clone graph, leadership scenario questions\nIntv 3: Minimum window substring, Serialize tree, leadership scenario questions\nIntv 4: Manager, non-tech, pure leadership\nIntv 5: keypad backtracking, some n-ary tree traversal with finding out grandparent-grandchildren relationship(very vaguely worded, she didn\'t know what ahe was looking for, clearly not came prepared), leadership questions\n\nNo DP!\n\nHired!

Phone Screen:\n\n1. LCA of 3 nodes disguised as first skip manager of 3 employees\n2. House robber tree variant(again disguised in other words)\n\nOnsite:\n\n5 