Google Interview Questions 2026

Published July 22, 2026 · Updated July 22, 2026

30 real interview questions asked at Google. Covers DSA / Trees, DSA / Graphs, Behavioral, System Design, DSA / Arrays, Domain, AI / RAG Pipelines, React / Virtualization, React / Architecture, React / Internals, System Design / File Sync, System Design / Search, System Design / Media Processing, DSA / Trie, Performance / gRPC, System Design / Graph Algorithms, System Design / Real-time, Architecture / API Design, React / Rendering, Python / Data Processing, System Design / Scalability. Reported by engineers who went through the Google process.

Questions Interview GuidesInterview GuidesInterview GuidesInterview Guides
30 questions
972 engineers asked
1792 upvotes

DSA / Trees (1)

Google Medium Technical round JavaC++Python

Given a binary tree, return the boundary of the tree in anti-clockwise direction starting from the root. The boundary consists of the left boundary, leaves, and the right boundary in reverse.

↑ 96 upvotes · 31 engineers asked this · SDE2

DSA / Graphs (3)

Google Hard Technical round

Implement Dijkstra's algorithm using a Fibonacci heap. Compare amortized complexity with a binary heap and explain when the Fibonacci heap is actually slower in practice despite the better theoretical bound.

↑ 71 upvotes · 18 engineers asked this · Staff
Google Hard Technical round JavaPythonGo

Implement a topological sort for a directed acyclic graph. Then extend it to detect cycles and explain how this maps to dependency resolution in build systems like Bazel.

↑ 61 upvotes · 38 engineers asked this · SDE2
Google Hard Technical round 6-10 yearsSystem DesignGo

Given a large dependency graph of build targets, design an algorithm to compute the minimal set of targets that need to be rebuilt after a file changes, and explain how you would parallelize the rebuild across workers respecting dependency order.

↑ 29 upvotes · 11 engineers asked this · Staff Engineer

Behavioral (3)

Google Easy HR round

Tell me about a time you had a strong technical disagreement with a senior engineer. How did you handle it, and what was the outcome? Be specific about the technical context and your reasoning.

↑ 54 upvotes · 22 engineers asked this · SDE1
Google Easy HR round

Google values "Googleyness". Describe a situation where you went significantly beyond your role to help a colleague or improve something that was not your responsibility.

↑ 42 upvotes · 25 engineers asked this · SDE1
Google Medium HR round 2-6 years

Tell me about a time your code caused a production incident. What was your immediate response, and what did you change afterward so it wouldn't happen again?

↑ 44 upvotes · 27 engineers asked this · Senior SDE

System Design (4)

Google Hard System Design round Distributed SystemsRedis

Design Google Search autocomplete. As a user types "wea", suggest "weather", "weather today", "weather London". Cover: trie vs inverted index, personalisation, freshness, latency budget (<100ms), and how you handle offensive query suggestions.

↑ 79 upvotes · 55 engineers asked this · SDE2
Google Hard System Design round Distributed SystemsKafkaGCP

Design Google Maps ETA calculation. How do you compute the fastest route for 1B+ users in real time? Cover: graph representation of road network, Dijkstra vs A* vs Contraction Hierarchies, live traffic data ingestion, and how you handle road closures.

↑ 72 upvotes · 48 engineers asked this · SDE2
Google Hard System Design round Distributed SystemsGCP

Design Bigtable or a wide-column store from scratch. Explain SSTable, memtable, compaction strategies (size-tiered vs levelled), bloom filters for read optimisation, and how you handle tombstones for deletes.

↑ 53 upvotes · 31 engineers asked this · Staff
Google Hard System Design round 5–8 YearsSystem DesignDistributed Systems

Design a URL shortening service (like bit.ly) that handles 1 billion shortened URLs and 100K redirects per second.

↑ 134 upvotes · 107 engineers asked this · Senior SDE

DSA / Arrays (1)

Google Medium Technical round JavaPythonC++

Given a list of intervals, merge all overlapping intervals and return the result. Explain the sort-then-scan approach and the edge cases (touching intervals, single interval, all disjoint).

↑ 67 upvotes · 43 engineers asked this · SDE1

Domain (1)

Google Hard Technical round JavaScriptNode.js

Explain how a browser renders a web page from the moment the user presses Enter. Cover: DNS resolution, TCP handshake, HTTP request, HTML parsing, CSSOM, render tree, layout, paint, and compositing. Where would you optimise for Core Web Vitals?

↑ 58 upvotes · 35 engineers asked this · SDE2

AI / RAG Pipelines (1)

Google Hard Scenario round 5–8 YearsLLMRAGPython

Our RAG pipeline responses are accurate in staging but hallucinate in production on long user queries. Walk me through how you debug and fix this.

↑ 112 upvotes · 89 engineers asked this · AI Engineer

React / Virtualization (1)

Google Medium Scenario round 3–6 YearsReactJavaScript

A list of 50,000 items renders in a React component. Users scroll and experience jank. How do you fix it without pagination?

↑ 109 upvotes · 86 engineers asked this · Full Stack Developer

React / Architecture (1)

Google Hard System Design round 5-10 years

You're building a real-time collaborative document editor (like Google Docs) in React. Multiple users edit simultaneously. How do you handle state synchronization without the UI flickering or losing cursor position?

↑ 55 upvotes · 23 engineers asked this · Staff

React / Internals (1)

Google Hard Screening round 5-8 years

Explain how React's reconciliation algorithm decides what to re-render. A senior dev claims 'adding a key prop always makes things faster.' Is he right?

↑ 62 upvotes · 30 engineers asked this · SDE2

System Design / File Sync (1)

Google Hard System Design round 5-9 years

Design Google Drive's file sync system. A file changed on desktop must appear on mobile within 5 seconds. Files can be up to 10GB. Handle 100 million users.

↑ 24 upvotes · 22 engineers asked this · Staff

System Design / Search (2)

Google Hard System Design round 5-9 years

Design a search autocomplete system (like Google's search bar). It must return results in under 50ms, handle 100,000 queries per second, and personalize results based on user history.

↑ 25 upvotes · 23 engineers asked this · Staff
Google Hard System Design round 4-7 yearsSystem DesignDistributed Systems

Design an autocomplete/typeahead system for a search engine handling 100K queries per second. Discuss the trie-based approach, how you would rank suggestions, and how you would keep the trie updated with trending queries without hurting read latency.

↑ 61 upvotes · 24 engineers asked this · Senior SDE

System Design / Media Processing (1)

Google Hard System Design round 5-9 years

Design YouTube's video upload and processing pipeline. A user uploads a 4K video of 10GB. How does it become available in 360p, 720p, and 4K for streaming?

↑ 82 upvotes · 10 engineers asked this · Staff

DSA / Trie (2)

Google Hard Technical round 3-6 years

Implement a trie data structure. Your implementation must support: insert, search, and startsWith. Then optimize space for a dictionary with 1 million words.

↑ 28 upvotes · 36 engineers asked this · SDE2
Google Hard System Design round 4-7 years

How would you design and implement an autocomplete system? Focus on the data structure and ranking.

↑ 56 upvotes · 34 engineers asked this · SDE2

Performance / gRPC (1)

Google Hard Scenario round 4-8 years

Your gRPC service has p99 latency of 1 second. Adding a timeout of 500ms seems to help p99 but now 1% of requests fail with DeadlineExceeded. What's the correct approach?

↑ 48 upvotes · 6 engineers asked this · SDE2

System Design / Graph Algorithms (1)

Google Hard System Design round 6-10 years

Design the backend for a Google Maps-like routing service with real-time traffic.

↑ 47 upvotes · 15 engineers asked this · Staff

System Design / Real-time (1)

Google Hard System Design round 6-10 years

Design a real-time collaborative whiteboard like Miro where multiple users draw simultaneously.

↑ 49 upvotes · 17 engineers asked this · Staff

Architecture / API Design (1)

Google Medium Screening round 3-6 years

Explain gRPC vs REST API. When would you choose gRPC?

↑ 62 upvotes · 10 engineers asked this · SDE2

React / Rendering (1)

Google Medium Technical round 3-6 yearsReactJavaScript

Explain the difference between reconciliation and the commit phase in React. Why can render be interrupted in Concurrent Mode but commit cannot?

↑ 38 upvotes · 15 engineers asked this · Senior SDE

Python / Data Processing (1)

Google Medium Technical round 2-5 yearsPython

You have a 50GB CSV file and only 8GB of RAM. Walk through how you would compute the average of one column using pandas without crashing the process.

↑ 33 upvotes · 19 engineers asked this · Data Scientist

System Design / Scalability (1)

Google Hard System Design round 4-8 yearsSystem DesignDistributed Systems

Design a URL shortener that must handle 100M new URLs per day and 10x that in reads. Walk through your ID generation strategy and why a simple auto-increment counter breaks at this scale.

↑ 41 upvotes · 22 engineers asked this · Senior SDE

Practice these questions with AI feedback

Get instant grading on your answers, identify your weak areas, and generate a personalised 14-day study plan — all free.

Build my study plan →

Google interview guides by role

Google SDE2 Guide Google Staff Guide Google SDE1 Guide Google Senior SDE Guide

Google questions by technology

Google Python Google Distributed Systems

More companies

Amazon Microsoft Flipkart Swiggy Meta Apple Netflix Uber Airbnb Stripe Razorpay PhonePe Paytm Zomato Salesforce Oracle Adobe LinkedIn Atlassian Accenture Deloitte Wipro Infosys TCS Capgemini PayU General Anthropic OpenAI TikTok JPMorgan Walmart Spotify DoorDash Goldman Sachs Revolut Canva Capital One Lyft SAP Siemens Shopify Grab Cognizant LTIMindtree Myntra Hotstar Twitter Snowflake

Frequently asked questions

Given a binary tree, return the boundary of the tree in anti-clockwise direction starting from the root. The boundary consists of the left boundary, leaves, and the right boundary in reverse.
Given a binary tree, return the boundary of the tree in anti-clockwise direction starting from the root. The boundary consists of the left boundary, leaves, and the right boundary in reverse.
Implement Dijkstra's algorithm using a Fibonacci heap. Compare amortized complexity with a binary heap and explain when the Fibonacci heap is actually slower in practice despite the better theoretical bound.
Implement Dijkstra's algorithm using a Fibonacci heap. Compare amortized complexity with a binary heap and explain when the Fibonacci heap is actually slower in practice despite the better theoretical bound.
Tell me about a time you had a strong technical disagreement with a senior engineer. How did you handle it, and what was the outcome? Be specific about the technical context and your reasoning.
Tell me about a time you had a strong technical disagreement with a senior engineer. How did you handle it, and what was the outcome? Be specific about the technical context and your reasoning.
Design Google Search autocomplete. As a user types "wea", suggest "weather", "weather today", "weather London".
Design Google Search autocomplete. As a user types "wea", suggest "weather", "weather today", "weather London". Cover: trie vs inverted index, personalisation, freshness, latency budget (<100ms), and how you handle offensive query suggestions.
Implement a topological sort for a directed acyclic graph. Then extend it to detect cycles and explain how this maps to dependency resolution in build systems like Bazel.
Implement a topological sort for a directed acyclic graph. Then extend it to detect cycles and explain how this maps to dependency resolution in build systems like Bazel.