Google | Software Engineer | Coding and Behavioral Interview
Timeline: 2026(Jan - Mar) • Fulltime • NewGrad • 
Waiting for result
I had my interview for the Software Engineer position at Google in early 2026. The interview consisted of both coding and behavioral questions. For the coding part, I was asked to solve two problems on the spot: one involved tree traversal and the other focused on dynamic programming. I used the online coding platform to share my screen and write my code.
The behavioral part included questions about my past projects and how I handled team conflicts. The interviewer was friendly and provided feedback during the coding problems, which helped me improve my logic on the fly. Overall, it was a great experience, and I felt I had a solid chance of moving forward in the interview process.
Interview Questions
Tree Distance Sum Problem
Given a binary tree, calculate the sum of distances from the root to all leaves.
Difficulty: Medium | Reference: LC-123 | Tags: Tree, DFS
Longest Increasing Subsequence
Given an integer array, return the length of the longest increasing subsequence.
Difficulty: Medium | Reference: LC-300 | Tags: Dynamic Programming, Array