Current Position: SDE 3 in a start up
YOE: 5yrs 2 months
Location: Bangalore, India

Note: Cannot unveil the actual questions due to NDA

Round 1 - Technical Screening

I was asked couple of theortecial questions on trees, BST, self balancing trees etc. Later I was asked one question on BST. Interviewer was very friendly and once he heard my approach he started giving me pointers in my implementation if I was going away from what I said

Performance: Great
Problem level: LC Medium

After couple of days got a call from recuiter stating that I am shortlisted for further rounds and I will have 4 technical and 1 behavioural round. I had a choice to pick either Design or DS-Algo for one of the technical rounds and I picked DS & Algo.

Round 2 - Virtual On-site Round 1 - DS & Algo

The interviewer straight forward jumped into the question and it was on Graphs and Dynamic Programming. Initially I discussed the approach and didn't see any reaction from the interviewer and went ahead with the DFS approach with some add on logics. Tried communicating with the interviewer during the process but there was never any response from him. By the end of the round I was able to formulate an approach but it was failing in couple of corner cases.

This question was an NP Hard question and this is something that ideally was not meant for a 45 mins round.

Performance: Bad - Average
Problem Level: Hard (NP Hard problem)

Couldn't find this question or a similar question on any platform

Round 3 - Virtual On-site Round 2 - DS & Algo

In this round I was asked a question related to n-ary trees. Though I could see that there is a simple BFS/DFS solution, I tried complicating it in the first 20 minutes to see if there is any better answer for the same. After the failed trials I approached the question with BFS and got the result in time. Later the interviewer said that it's the most optimal answer and there was nothing better. So if I would have solved it early then there might have been another follow up question.

In this round the interviewer was pretty positive and was communicating all through the round

Performance: Good - Average
Leetcode Problem level: Medium-Hard

Round 4 - Virtual On-site Round 3 - DS & Algo

In this round I was asked only 1 question which had too many sub questions to reduce the search space, time complexity and needed a lot of analytical thinking. The interviewer was very friendly and once he understood my approach he was always encouraging that I am reaching the solution and all it needs is fine tuning

I came up with the solution with 5 minutes left and that was the most optimal solution.

Performace: Great
Problem Level: Medium-Hard

Round 5 - Virtual On-site Round 4 - DS & Algo

In this round I was asked a question on Recursion and Dynamic Programming. I initially gave an exponential time solution and later reduced it to linear time solution using DP. Even in this round the interviewer was very friendly and threw me pointers if I am moving away from the already discussed approach

Performance: Great
Problem Level: Medium - Hard

Round 6 - Virtual On-site Round 5 - Googleyness

I was asked 5 situational questions to assess my Googleyness. Of the 5 questions, 2 had ambiguity in them and needed to be answered from multiple perspectives. The interviewer was totally positive

I don't like to self evaluate my behavioural rounds as these are pretty subjective from person to person.

Current Status: The day has come (after 16 days of my completion of all rounds), Google's Hiring Committee said a No citing to ambiguity in my performance across rounds. Thank you everyone for your well wishes (edited)