Cracking Google’s Software Engineer Interview: Tackling Tree Distance Sum & Fibonacci Challenges

Baidu | AI NLP Lab Intern | Interview Experience

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

Interview Process

The interview process began with an HR screening, followed by multiple technical interviews focused on algorithms and data structures. The interviews were conducted in a standard format, where candidates were asked to solve problems on a whiteboard. The overall impression was that the interviewers were friendly and supportive, encouraging candidates to think aloud while solving problems.

Technical Questions

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

Tips & Insights

  • Practice coding on a whiteboard to get comfortable with explaining your thought process.
  • Focus on understanding tree-related algorithms, as they are commonly tested.
  • Be prepared to discuss your previous projects and how they relate to the position.