← Back to all experiences
Pending
Google Interview
Software Engineer, University Graduate 2026
Process Overview
- Applied April 12th, interviews held September 4th, 8th, and 23rd.
Interview Rounds Breakdown
Technical Round 145 mins
GraphsAlgorithms
The problem was presented in a shared document.
The candidate utilized Dijkstra’s algorithm to solve the primary graph problem.
The interviewer provided a follow-up that served as an extension to the initial problem.
The candidate successfully implemented the full code and provided a detailed time complexity analysis.
Questions Asked
Graph-based problem requiring shortest path or traversal logic.
Solve GraphsDijkstra
Technical Round 260 mins
Binary TreesBehavioral
The candidate solved the initial binary tree problem and the first follow-up within 30 minutes.
The second follow-up was significantly more difficult; the candidate did not reach the optimal solution.
The interviewer mitigated candidate anxiety by clarifying that the final follow-up was for discussion purposes only.
Behavioral questions were addressed using the STAR (Situation, Task, Action, Result) method.
Technical Round 360 mins
StringsHash MapsBehavioral
The candidate used a hash map to group strings based on specific criteria.
The candidate performed a dry run on test cases three times to ensure correctness.
Key Takeaways & Advice
Candidate Advice
- Do not panic if a follow-up question is difficult; focus on communicating the thought process.
- Acknowledge when an optimization is not possible if the current complexity is already optimal.
- Be prepared for a lengthy post-interview waiting period.
Preparation Tips
Final Verdict
The result for this interview is still pending.