Cracking Google's Software Engineer L3 Interview: Tackling Tree Problems and More

Google | Software Engineer | Interview Experience

Interview Date: Not specified
Result: Not specified
Difficulty: Not specified

Interview Process

The interview consisted of multiple rounds, including a coding round and behavioral interviews. In the coding round, I was asked to solve problems primarily focused on algorithms and data structures. The interviewers were friendly and provided hints when I was stuck. The behavioral section emphasized my past projects and how I approached various challenges, which I found very important. Overall, the experience was intense yet rewarding.

Technical Questions

  1. Tree Distance Sum Problem (Tree, DFS)
  2. Fibonacci Tree Path Calculation Using Preorder Numbering (Dynamic Programming, Tree)

Tips & Insights

Be prepared to discuss your past projects in detail and think aloud during coding challenges.