Total number of interviews : 5

Round 1 - DSA
Total 3 questions were asked
Q1 - Very standard tree traversal
Q2 - Variant of a popular interval merge question, I solved it rather quite quickly
follow up: Discussion around solving it at scale.

Q3 - Some Adaptation of the above stated 1D problem to a similar 2D problem. I was able to discuss soln for this using a line sweep alogrithm however interviewer asked me not to code as we were running short of time

Overall difficulty - Medium

Round 2 - DSA
1 question
A detailed description explaining a popular game and question boiled down to given state x is it possible to reach to winning state

• Solved it with recursion
• Code was very lengthy and to code it in time had to apply right code design assumptions

Overall difficulty - Hard

Round 3 - SD

• Question was a sub-problem of a very popular SD question
• Lot of focus on resource estimations and ability to scale to solve this particular scope. Seemed like focus was on gauging my depth with large scale systems.

Overall difficulty - HARD

Round 4 - SD

• Problem statement was rather new and focus was on breadth, with intent to solve complete problem statement with working system design.
• Problem had multiple moving components and may be thats why interviewer was evaluating my ability to capture E2E SD.

Overall difficulty - MEDIUM

Round 5 - Googlyness
Discussion around my experience on different kind of projects and my opinion on couple of hypothetical scenarios

Overall difficulty - EASY

All interview feedbacks were positive and was followed by quick team match and offer