2 phone screen rounds\n\n**Round 1:**\n* Project Explaination\n* https://leetcode.com/problems/validate-binary-search-tree/\n\n**Round 2:**\n* https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/\n\n**5 onsite rounds(Seattle):**\n\n**Round 1:**\n* LP\n* past project explaination\n\n**Round 2: [System Design]**\n* LP\n* Design ride-sharing system like Uber/Lyft\n\n**Round 3:**\n* LP\n* https://leetcode.com/problems/lfu-cache/\n\n**Round 4:**\n* LP\n* https://leetcode.com/problems/longest-increasing-path-in-a-matrix/\n\n**Round 5:**\n* LP\n* Find the minimum value element repeated multiple time in a not sorted sequence of elements.\n* Later they modified it to: find the minimum value element repeated more that K times in a not sorted sequence of elements.\n* After that: They asked if the sequence is so huge that we have to do the computation in the different distributed systems, how will you approach the same?

2 phone screen rounds\n\nRound 1:\n Project Explaination\n https://leetcode.com/problems/validate-binary-search-tree/\n\nRound 2:\n https://leetcode.com/problem