The recruiter contacted me over Linkedin and skipped screening rounds based on my current employer.\n\n**Round 1:** Do not remember the exact but it required BFS over Binary Marix and Multi-Source Shortest Path.\n**Round 2:** Similar to Range Max with updates. Did it with Segment Tree (Or any other algo)\n**Round 3:** A tree and its two nodes were provided. Need to return a string of L (Left), R (Right), and U (Up) which represent the kind of steps required to reach the second node from the first.\nFollow Up: The same question but this time tree was provided as N integers where the `ith` node has `2*i` and `2*i+1` as their left and right children. (Solution complexity: logN)\n\nAll rounds went good. They have a strict duration of 45mins for each round but I completed all the rounds with 5-10 mins remaining.\n\nOffered TC: 25L base + 15L stocks = 40L for first year (62k USD stocks vested ver 4 years)\nYOE: 10 months\n\n

The recruiter contacted me over Linkedin and skipped screening rounds based on my current employer.\n\nRound 1: Do not remember the exact but it required BFS ov