Cracking Google's Software Engineer Interview: Coding Challenges on Trees & More

Google | Software Engineer | Interview Experience

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

Interview Process

I had two rounds for the Tech Phone Screen for the Software Engineer position at Google. The first round was mostly behavioral, where they assessed my thinking process through a coding challenge. I was asked about my previous projects and how I tackled challenges during those projects.

In the coding part, I encountered a problem related to binary trees that required traversal and understanding of tree structures. They provided hints when I got stuck, which helped me navigate through it.

The second round was more technical, focusing on algorithms. I had questions about sorting and searching algorithms, and they wanted to see how I handled edge cases. The interviewer was quite friendly and gave me feedback during the session, which made it less stressful.

Overall, the interview experience was smooth and quite insightful.

Technical Questions

  1. Binary Tree Inorder Traversal (Tree, DFS)
  2. Two Sum (Array, Hash Table)

Tips & Insights

Prepare for both behavioral and technical questions, and be ready to explain your thought process clearly during coding challenges.