Rounds attended: 3

1. Technical Recruiter round:
   • Conversation over the phone with basic questions like: "Introduce yourself," "What are your hobbies?", a collaboration-related situation question, and "What are you looking forward to?"

Round 2, 3: Technical interview Round 4, 5: Reverse technical interview Round 6: Hiring manager Round 7: HR

The initial questions were easy, including a 2D array problem and a question on creating class-based callback functions.

The follow-up questions were difficult.

An optimal solution was provided for the 2D array problem. However, the question was then changed to focus on caching. I was subsequently asked how to optimize the solution if caching was to be used.

The 2D array question was structured as a balanced binary tree. The last row of the array determined the root's value (1 or 0). A parent node was 1 only if both its children were 1; otherwise, it was 0.

Caching was later applied to this problem, and I was asked to optimize it further. We agreed upon a time complexity of O(log n), but the interviewer was seeking something different.