Navigating Google's Software Engineer Interview: Tackling the Tree Distance Sum Problem

Google | Software Engineer | Interview Experience

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

Interview Process

I had a technical phone screen with Google. The interviewer was friendly and started with some introductory questions. Then, he quickly jumped into a coding problem. The problem was about calculating the distance sum of all paths in a binary tree. I used a depth-first search approach to traverse the tree and calculate the distances. The interviewer guided me through the problem and was very supportive. In the second half, he asked about my past projects and how I approached problem-solving. At the end of the call, he told me that I had performed well and that there would be more rounds to come.

Technical Questions

  1. Tree Distance Sum Problem (DFS, Trees)

Tips & Insights

Be prepared to explain your thought process clearly and be open to guidance during the coding problem.