Software Engineer
Interview Date
Mid-August (recruiter contact) to ~October (onsite), likely 2025
Result
Hire / Strong Hire for coding rounds (overall resu
Difficulty
Medium to Hard
Rounds
Phone Interview, On-Site Round 1, On-Site Round 2, On-Site Round 3 (total 4 technical rounds)
Drive Type
Full-Time
Topics asked
Detailed experience
College: Not Specified
Interview Date: Mid-August (recruiter contact) to ~October (onsite), likely 2025
Interview Type: Full-Time
Result: Hire / Strong Hire for coding rounds (overall result not explicitly stated but positive progression)
Difficulty: Medium to Hard
Rounds: Phone Interview, On-Site Round 1, On-Site Round 2, On-Site Round 3 (total 4 technical rounds)
Topics Asked: Data Structures, Algorithms, Dijkstra's algorithm, DFS, Dynamic Programming (Knapsack, Memoization), Time Complexity, Space Complexity
This LeetCode Discuss user shared their Google interview experience after applying via the portal.
Phone Interview
There was no introduction, directly jumping into problems. The first question was based on Dijkstra's algorithm, described as "pretty straight forward" (similar to LeetCode's "Path with Minimum Effort"). After discussing and coding, a modified follow-up question based on the same approach was given, which was also coded. Time complexity was discussed. Verdict: Hire.
On-Site Round 1
After introductions, the round focused on coding. One question was given with several follow-ups, involving discussions around edge cases and clarifications. It was a DFS-based approach. The interviewer was satisfied, and a follow-up question on reducing time complexity (kind of Memoization) was discussed. Time complexity for both approaches was covered. Verdict: Hire / Strong Hire.
On-Site Round 2
The interviewer provided a problem statement without test cases, requiring the candidate to read, prepare test cases, and clarify doubts. It seemed like a Knapsack problem (take/skip elements to maximize result). The recursive approach was coded and satisfied the interviewer, then optimized with memoization. Discussion around memory optimization led to selecting a different data structure for memoization.
On-Site Round 3
This was the final technical round. The problem was almost similar to "Find all possible recipes from given supplies" on LeetCode but had extra constraints and was time-consuming to code. The candidate discussed the approach, coded it, but it took almost all the time. A second question was pasted, and the approach was told, but there wasn't time to code it.