Software Engineer (L3)
Anonymous
1 day ago
I was referred after reaching out on LinkedIn and sharing my resume.
Unexpectedly technical for an intro call — complexity of Bubble Sort and how heap operations work at a high level. Don't treat this as a pure logistics call; keep fundamentals warm from day one.
A graph problem. Not the hardest of the loop, but clearly designed to filter anyone without solid traversal basics.
String manipulation. The interviewer mostly watched how cleanly I handled edge cases while parsing/transforming.
The toughest round for me. I first solved it with heaps at O(n log n); the interviewer kept pushing for better. Thinking out loud, I reached a bucket sort solution — constant time for this specific problem. Really a test of how far you can optimise a working solution under pressure.
Hardest round of the loop: range queries on an array, with a follow-up that needed binary search to make querying efficient.
A conversation rather than an interrogation — background, deep dive into projects and my exact contribution, and why Google specifically.
Selected for L3.
Sign in to join the discussion.
Sign in to commentNo comments yet — be the first to respond.