Curated Question Bank

Google Software Engineer Interview Questions (2026)

Google's software engineer loop is famous for its emphasis on data structures and algorithms. Most candidates face two or three coding rounds, at least one system design round (for L4 and above), and a behavioral round Google internally frames as "Googleyness and Leadership." The bar is less about exotic tricks and more about clean, correct, well-communicated solutions with tight complexity analysis.

Interviewers are trained to probe how you think, not whether you've memorized a specific problem. They want to hear you clarify the problem, state assumptions, reason about time and space out loud, and handle follow-ups that tighten constraints. A working brute force you then optimize beats a half-remembered optimal solution you can't explain.

The questions below reflect the categories Google leans on. Practice narrating your approach: the difference between an L3 and an L4 signal is often communication and the ability to discuss trade-offs, not raw problem-solving speed.

The Haggle Real-Time Advantage

In a live Google interview, Haggle transcribes the question, reads the shared coding doc via on-screen OCR, and suggests a structured approach with complexity analysis in under 500 ms — fully on-device. Use it to stay structured across the algorithm and Googleyness rounds.

Core Technical & Behavioral Questions

1

Given a list of intervals, merge all overlapping intervals.

Recommended Answer Framework

Sort by start time, then sweep once merging when the current start ≤ previous end. O(n log n) for the sort dominates. State the sorted invariant out loud — Google interviewers reward a clearly-stated approach before you code.

2

Find the k-th largest element in an unsorted array.

Recommended Answer Framework

Offer a min-heap of size k (O(n log k)) and quickselect (O(n) average). Discuss the trade-off: quickselect is faster on average but O(n²) worst case; the heap is steadier and streams. Naming both signals depth.

3

Serialize and deserialize a binary tree.

Recommended Answer Framework

Pick a traversal (preorder with null markers is clean) and show both directions are consistent. Discuss the delimiter and how you reconstruct. Google likes seeing you handle the null-node edge case explicitly.

4

Word ladder: shortest transformation sequence between two words.

Recommended Answer Framework

Model as BFS over a graph where edges connect words differing by one letter. Discuss building adjacency efficiently (wildcard buckets) and why BFS guarantees the shortest path. Bidirectional BFS is a strong follow-up.

5

Design an LRU cache.

Recommended Answer Framework

Hash map + doubly linked list for O(1) get/put. Walk the eviction path explicitly. This is a classic Google warm-up that tests whether you can combine two structures cleanly under time pressure.

6

Number of islands in a 2D grid.

Recommended Answer Framework

DFS or BFS flood fill from each unvisited land cell, counting components. O(rows×cols). Mention in-place marking vs a visited set as a space trade-off — a common Google follow-up.

7

Design a system to return the top-k most frequent search queries.

Recommended Answer Framework

Scope read vs write rate first. Discuss a count-min sketch or a heap over a hash map for approximate top-k at scale, and how you'd shard. This bridges into the system design round many Google loops include.

8

Tell me about a time you had to make a decision without complete data.

Recommended Answer Framework

STAR. Google's 'Googleyness' round looks for comfort with ambiguity, bias to action balanced with judgment, and learning from the outcome. Pick a real example with a concrete result and what you'd do differently.

Ready to Take Control of Every High-Stakes Conversation?

Download Haggle for your desktop today. Run 100% offline via local Ollama models or connect your private BYOK API keys with zero latency.