Google | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview process consisted of two parts.
Coding Round: In the coding round, I was asked to solve two problems. The first problem was related to arrays, involving finding the maximum sum of a non-contiguous subarray. The second problem was a tree-related question where I had to implement depth-first search to find the longest path in a binary tree. I felt comfortable with both problems and was able to provide optimal solutions. The interviewer was supportive and guided me through the process when I encountered any issues.
Behavioral Round: The behavioral part focused on understanding my past experiences and how I handle challenges. I was asked about a time when I faced a significant obstacle during a project and how I went about solving it. The questions revolved around teamwork, leadership, and initiative. Overall, the interviewer seemed interested in my thought process and how I reflected on my experiences. I left the interview feeling positive about my performance, but I am still waiting for the results.
Technical Questions
- Maximum Sum of Non-Contiguous Subarray (Array)
- Longest Path in a Binary Tree (Tree, DFS)
Tips & Insights
Reflect on past experiences and be prepared to discuss how you handle challenges. Show your thought process during problem-solving.