Google | Software Engineer | Phone Screen
Timeline: 2026(Jan - Mar) • Fulltime • NewGrad • 
Waiting for result
In this interview, I faced a dynamic programming question that focused on solving a specific problem efficiently. The interviewer emphasized the importance of understanding the problem before diving into coding. Time management was a crucial aspect during the assessment, as I needed to justify my thought process clearly and efficiently conduct tests. After addressing the technical questions, there was a set of behavioral questions that helped me to present my soft skills and project experiences effectively.
Interview Questions
Dynamic Programming Problem
Given an array of integers, find the maximum sum of non-adjacent numbers. Numbers can’t be adjacent.
Difficulty: Medium | Reference: LC-198 | Tags: Dynamic Programming
Two Sum Problem
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
Difficulty: Easy | Reference: LC-1 | Tags: Array, Hash Table