Campus placement · 2026

Google Interview Questions 2026 (With Answers + Mock Test)

Everything you need for Google on-campus or virtual drives: real-style question prompts, test pattern, difficulty, and a free mock test so you rehearse under time pressure before the shortlist matters.

  • Hiring process5 main stages from application to offer.
  • DifficultyOverall: Hard — see section below for what that means.
  • Roles offeredSoftware / engineering roles (campus-specific) · Analyst or APM-style tracks where listed by the recruiter · Intern-to-full-time conversion paths (varies by region)

Last updated: June 2026·Based on latest campus placement trends for Product / big-tech style roles.

Key insights for Google

Distributions and rates are modeled from typical campus placement patterns for this company category — always confirm cutoffs and syllabus with your TPO and official briefings.

Most asked topic

Graphs & multi-step DSA (trees as graphs, BFS layers)

Difficulty score

8/10

Hard (8/10): Bar is high for speed, correctness, and follow-up depth. Candidates who only memorize templates tend to struggle on Google-style extensions.

Prep time

814 weeks

Focused daily blocks, not passive reading.

Estimated interview focus mix
DSA / coding-style56%
Aptitude / speed reasoning10%
Core (fundamentals, HR, cases, domain)34%

Selection funnel

Roughly 2.6–4.9% of screened candidates reach final offer stages on competitive campuses (varies by batch and role).

Hiring focus

Speed coding with edge-case discipline, verbal complexity trade-offs, and behavioral depth with metrics.

Actionable tips
  • Log every OA mistake for Google in a spreadsheet — one column for "wrong assumption" — and redo only those patterns twice weekly.
  • Record yourself narrating while coding; interviewers grade communication as heavily as correctness on many panels.

What our data shows for Google

Modeled from the same deterministic question bank as the lists below — stable per company slug, comparable across builds.

  • Most frequent topic: Systems
  • Most recent trend: 50% of modeled prompts in this bank sit in the 2026 recency band — panels are refreshing OA mixes faster than three years ago.
  • Hardest round: Technical / coding screens carry the hardest difficulty mix in this modeled set.
  • Key insight: High-confidence rows cluster on OA-style prompts; treat them as your minimum viable prep set for Google.

Campus Placement Mode

Fresher Mode ON: simpler phrasing, guided feedback, confidence-first prompts.

Recent interview experience (2025–2026)

Representative campus track for Product / big-tech style interviews — rounds and examples vary by office; use this as a rehearsal script, not a guarantee.

Winter / early 2026 intern and new-grad cohorts · cohort signals for Google

Round 1: Online assessment

Timed platform with two algorithmic tasks plus a short MCQ block on Google fundamentals.

Sections

  • Coding (2 problems, partial scoring)
  • MCQ: complexity, trees, SQL basics
  • Optional: probability warm-ups

Example prompts

  • Subarray with bounded distinct elements + follow-up on memory
  • MCQ: best/worst case for quicksort pivot choices

90 minutes typical; platform timer non-pausable.

Round 2: Technical interview

Live coding with nested constraints; interviewer extends problem twice if you solve quickly.

Example prompts

  • Implement LRU with O(1) ops then discuss concurrency caveats

Problem types

  • Graph BFS layering
  • Heap + greedy scheduling
  • Binary search on answer space

45–60 minutes per panel; 1–2 panels common.

Round 3: HR / behavioral

STAR depth on ownership, ambiguity, and collaboration; expect two scenario probes on deadlines.

Example prompts

  • Why Google vs other offers?
  • Tell me about a time metrics disagreed with intuition — what did you ship?

30–45 minutes; sometimes combined with hiring manager.

Most asked Google interview questions

High-frequency signals from the full bank — same slug always yields the same top set, ranked by modeled panel recurrence for Product / big-tech style.

  1. HardHigh2026

    Source: Reported by candidates

    Tags

    StringsTrees
    Confidence90%

    A typical live round for Google started with: Trap rain water II (3D) — high-level approach if full code is too long for Google timebox.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
  2. HardHigh2026

    Source: Common OA pattern

    Tags

    TreesGraphsDP
    Confidence91%

    Hiring managers at Google frequently open with: Substring with concatenation of all words — rolling hash plan and collision handling for Google.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
    • Variant: same problem but sorted input / duplicates allowed — how does your invariant change?
    • Constraint twist: interviewer tightens memory or time — restate the trade-off you would negotiate at Google.
  3. HardHigh2026

    Source: Reported by candidates

    Tags

    Binary searchStrings
    Confidence93%

    Interview debriefs from 2025–26 mention: Kth largest in a stream — heap vs quickselect; which would Google infra prefer under memory caps?

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
  4. MediumHigh2026

    Source: Common OA pattern

    Tags

    GraphsDP
    Confidence85%

    Candidates were asked to Solve minimum cost to connect all points (MST variant) and justify Kruskal vs Prim for sparse graphs at Google.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
    • Variant: same problem but sorted input / duplicates allowed — how does your invariant change?
  5. EasyHigh2026

    Source: Reported by candidates

    Tags

    AptitudeReasoningSpeed
    Confidence94%

    A typical live round for Google started with: Blood relation puzzle with three generations — diagram speed matters on Google logical sets.

    Based on latest interview data (updated March 2026)

    Was this accurate?
  6. EasyHigh2026

    Source: Derived from recent drives

    Tags

    Scale-outSystems
    Confidence89%

    In a recent interview, Outline observability for a flaky gRPC service — metrics, traces, logs Google expects.

    Based on latest interview data (updated March 2026)

    Was this accurate?

Google Interview Questions 2026

All Google interview questions (2026) — structured like real OA and interview data: difficulty, modeled ask-rate, topic tags, and coding follow-ups. Phrases such as Google OA questions and Google coding questions match how candidates search before your drive.

Google coding questions

  1. MediumMedium2025

    Source: Common OA pattern

    Tags

    StringsTreesGraphs
    Confidence65%

    A common OA question at Google is to Given a DAG of Google microservice deploy order, return all topological sorts up to a cap — discuss explosion risk.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
    • Variant: same problem but sorted input / duplicates allowed — how does your invariant change?
  2. MediumHigh2026

    Source: Common OA pattern

    Tags

    GraphsDP
    Confidence85%

    Candidates were asked to Solve minimum cost to connect all points (MST variant) and justify Kruskal vs Prim for sparse graphs at Google.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
    • Variant: same problem but sorted input / duplicates allowed — how does your invariant change?
  3. MediumLowOlder

    Source: Derived from recent drives

    Tags

    DPGreedyHeap
    Confidence55%

    In a recent 2025 campus drive for Google, Implement word break II with pruning and explain memoization keys you would log in a Google code review.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Constraint twist: interviewer tightens memory or time — restate the trade-off you would negotiate at Google.
    • Edge extension: spell out behavior for empty input, duplicates, and overflow before you code.
    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
  4. MediumMedium2025

    Source: Reported by candidates

    Tags

    HeapBinary search
    Confidence70%

    One candidate reported that interviewers asked to Design an O(n) routine that finds the longest palindromic substring in a stream chunk arriving at Google ingestion.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Edge extension: spell out behavior for empty input, duplicates, and overflow before you code.
    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
  5. HardHigh2026

    Source: Common OA pattern

    Tags

    TreesGraphsDP
    Confidence91%

    Hiring managers at Google frequently open with: Substring with concatenation of all words — rolling hash plan and collision handling for Google.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
    • Variant: same problem but sorted input / duplicates allowed — how does your invariant change?
    • Constraint twist: interviewer tightens memory or time — restate the trade-off you would negotiate at Google.
  6. EasyMedium2025

    Source: Reported by candidates

    Tags

    DPGreedy
    Confidence78%

    A typical live round for Google started with: Recover BST from two swapped nodes — inorder pattern and O(1) space twist asked at Google panels.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Variant: same problem but sorted input / duplicates allowed — how does your invariant change?
    • Constraint twist: interviewer tightens memory or time — restate the trade-off you would negotiate at Google.
  7. HardLowOlder

    Source: Common OA pattern

    Tags

    GreedyHeapBinary search
    Confidence40%

    A recurring screen item at Google: Course schedule II — detect cycle and print one valid order; tie to Google dependency graphs.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Edge extension: spell out behavior for empty input, duplicates, and overflow before you code.
    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
  8. HardHigh2026

    Source: Reported by candidates

    Tags

    Binary searchStrings
    Confidence93%

    Interview debriefs from 2025–26 mention: Kth largest in a stream — heap vs quickselect; which would Google infra prefer under memory caps?

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
  9. HardMedium2026

    Source: Reported by candidates

    Tags

    GraphsDPGreedy
    Confidence72%

    Interview debriefs from 2025–26 mention: Implement trie prefix search with wildcard '.' and batch delete for Google config keys.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Variant: same problem but sorted input / duplicates allowed — how does your invariant change?
    • Constraint twist: interviewer tightens memory or time — restate the trade-off you would negotiate at Google.
    • Edge extension: spell out behavior for empty input, duplicates, and overflow before you code.
  10. HardMedium2025

    Source: Derived from recent drives

    Tags

    GreedyHeap
    Confidence71%

    Hiring managers at Google frequently open with: Maximal rectangle in binary matrix — reduce to histogram stacks and narrate stack states for Google.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Constraint twist: interviewer tightens memory or time — restate the trade-off you would negotiate at Google.
    • Edge extension: spell out behavior for empty input, duplicates, and overflow before you code.
  11. HardHigh2026

    Source: Reported by candidates

    Tags

    StringsTrees
    Confidence90%

    A typical live round for Google started with: Trap rain water II (3D) — high-level approach if full code is too long for Google timebox.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?
  12. HardLowOlder

    Source: Derived from recent drives

    Tags

    HeapBinary searchStrings
    Confidence53%

    Hiring managers at Google frequently open with: Design bitset operations for range flip/query — bit tricks interviewers at Google sometimes probe.

    Based on latest interview data (updated March 2026)

    Was this accurate?

    Variants & follow-ups

    • Edge extension: spell out behavior for empty input, duplicates, and overflow before you code.
    • Follow-up: they ask for a streaming / online version — what state do you keep and why?
    • Speed probe: can you remove one log factor — where is the bottleneck in your first approach?

Google OA questions

Online assessment / aptitude-style prompts commonly bucketed as OA.

  1. EasyHigh2026

    Source: Reported by candidates

    Tags

    AptitudeReasoningSpeed
    Confidence94%

    A typical live round for Google started with: Blood relation puzzle with three generations — diagram speed matters on Google logical sets.

    Based on latest interview data (updated March 2026)

    Was this accurate?
  2. EasyMedium2025

    Source: Reported by candidates

    Tags

    ReasoningSpeed
    Confidence75%

    Campus hire notes highlight: Clock angle at 3:42 — mental shortcut interviewers expect before Google technicals.

    Based on latest interview data (updated March 2026)

    Was this accurate?
  3. HardMedium2026

    Source: Reported by candidates

    Tags

    DIPatternAptitude
    Confidence75%

    Interview debriefs from 2025–26 mention: Data sufficiency: Is x^2 > y^2 given two inequalities — pick A/B/C/D/E like Google reasoning sets.

    Based on latest interview data (updated March 2026)

    Was this accurate?

Core / domain questions

  1. EasyHigh2026

    Source: Reported by candidates

    Tags

    DataReliability
    Confidence81%

    Campus hire notes highlight: What is tail latency amplification in microservices — mitigation list for Google.

    Based on latest interview data (updated March 2026)

    Was this accurate?
  2. EasyMedium2025

    Source: Reported by candidates

    Tags

    APIDataReliability
    Confidence72%

    A typical live round for Google started with: Explain optimistic locking vs pessimistic with SQL example relevant to Google inventory.

    Based on latest interview data (updated March 2026)

    Was this accurate?
  3. EasyHigh2026

    Source: Derived from recent drives

    Tags

    Scale-outSystems
    Confidence89%

    In a recent interview, Outline observability for a flaky gRPC service — metrics, traces, logs Google expects.

    Based on latest interview data (updated March 2026)

    Was this accurate?
  4. HardMedium2025

    Source: Common OA pattern

    Tags

    ReliabilityScale-outSystems
    Confidence64%

    A panel at Google reused this prompt: Sketch rate limiting token bucket vs leaky bucket for public API at Google.

    Based on latest interview data (updated March 2026)

    Was this accurate?

HR / behavioral questions

  1. EasyHigh2026

    Source: Reported by candidates

    Tags

    EthicsCommunicationTeamwork
    Confidence90%

    One candidate reported that interviewers asked to Give an example of a metric you owned end-to-end — numbers matter in Google behavioral rounds.

    Based on latest interview data (updated March 2026)

    Was this accurate?

Previous interview questions (real-style)

Short warm-up prompts — answer aloud in 60–90 seconds, then compare with your notes or an AI mock for feedback.

  • Coding: "Given an array, find the longest subarray with at most K distinct integers."
  • MCQ / CS: "Compare time complexity of merge sort vs quick sort in typical implementations."
  • HR / behavioral: "Tell me about a time you missed a deadline and how you recovered."
  • Product sense (if applicable): "How would you prioritize two features with conflicting stakeholder pressure?"
  • Debugging: "Walk through how you would find a memory leak in a service you own."

Common HR questions

  • Why do you want to join Google?
  • Describe a conflict where you changed direction after feedback.
  • Tell me about a project where you owned outcomes end-to-end.

People also ask

  • Is Google interview difficult for freshers?

    Yes — Google campus and new-grad tracks are selective. Expect strict time limits on coding, follow-up probes, and high signal on communication. A free mock test helps you practice pacing and articulation under pressure.

  • How many rounds are in Google campus placement?

    Most Google loops include an online assessment, one or more technical interviews (DSA and sometimes design fundamentals), then behavioral or hiring-manager rounds. Exact stages vary by role and region.

  • What DSA topics are asked in Google interviews?

    Arrays, strings, hash maps, trees, graphs, two pointers, sliding window, binary search, and basic DP appear frequently. Practice medium problems until you can explain trade-offs cleanly.

  • Does Google ask system design in fresher interviews?

    Full system design is less common for pure fresher roles, but you may see architecture discussions, API trade-offs, or scalability basics. Prepare one concise mental model for caching, databases, and scaling reads.

Interview process

  1. 1

    1. Resume + online application

    Shortlisting by CGPA, tests, or resume keywords depending on Google and your campus policy.

  2. 2

    2. Online assessment

    Coding and sometimes MCQs; focus on speed, correctness, and hidden edge cases.

  3. 3

    3. Technical interviews

    One or more DSA rounds; be ready to code live and verbalize trade-offs.

  4. 4

    4. Behavioral / hiring manager

    STAR stories, ownership, ambiguity, and collaboration under deadlines.

  5. 5

    5. Offer & team matching

    Compensation discussion and start date; confirm documents with your TPO.

Online test pattern

Most Google campus pipelines open with a timed online assessment combining coding problems and multiple-choice CS fundamentals.

  • Sections: Coding (1–2 problems), Data structures & algorithms MCQs, Sometimes: probability, DB, or OS basics
  • Typical volume: Roughly 2–4 coding tasks plus 10–30 MCQs when MCQs are included (varies by year).
  • Duration: 60–120 minutes total is common; confirm in your invite.

Interview pattern summary

Expect 3 to 5 rounds: online coding assessment, DSA-heavy interviews, product or behavioral depth, and communication quality under pressure.

Difficulty level

Hard

Bar is high for speed, correctness, and follow-up depth. Candidates who only memorize templates tend to struggle on Google-style extensions.

Comparable to other top product companies (Amazon, Microsoft, Meta) on coding rigor; aptitude weight is usually lower than in services-campus drives.

Aptitude and screening

Aptitude is usually moderate, but problem-solving speed and coding correctness standards are high.

Google OA questions 2026

Google online assessments in 2026 still lean on timed platforms; expect the mix below rather than generic public PDFs alone.

  • Two medium-hard coding tasks with hidden tests; partial credit if platform supports.
  • MCQ block on DS complexity, trees, and sometimes SQL or OS trivia.
  • 90–120 minute window; tab switching may be logged on official platforms.

Is Google interview hard?

Yes — Google is selective on campus: the OA filters hard, and technical panels add follow-ups until you hit uncertainty.

  • OA knockouts are common even for strong coders who skip edge-case drills.
  • Interview difficulty spikes in follow-ups — one more constraint changes complexity class.
  • Behavioral round still fails candidates with vague ownership stories.

Google interview experience for freshers

Freshers should expect Google to test consistency across OA, technical depth appropriate to the role family, and HR clarity on relocation and learning agility.

  • Bring 3 STAR stories with metrics from internships or academic projects.
  • Practice medium LeetCode until you can code and explain in under 25 minutes cold.
  • Mock behavioral with a friend who interrupts you — simulates real stress.

Google vs similar companies

Benchmark difficulty and focus — use the row for Google as your anchor, then cross-train with peers in the same cluster.

CompanyDifficultyFocus
GoogleYouHardPrimary target — use insights + mock drills on this page
GoogleVery highDSA depth, scale thinking, behavioral signal
MicrosoftHighPractical coding, collaboration scenarios
AmazonVery highLP-style behavioral + bar-raiser coding
MetaVery highSpeed, product intuition, strong coding

Topics to prepare

DSA / logical coding

  • Arrays & hashing
  • Binary search
  • Trees & BST
  • Graphs (BFS/DFS)
  • Heaps
  • Dynamic programming (foundations)
  • Strings & two pointers

Core subjects

  • Operating systems basics
  • DBMS & SQL
  • Networks (HTTP, DNS at a high level)
  • OOP concepts

Behavioral

  • STAR stories with metrics
  • Conflict resolution
  • Prioritization
  • Learning from failure
  • Teamwork under deadlines

Technical depth (if applicable)

  • Data structures and algorithms
  • Time-space optimization
  • System design fundamentals
  • Behavioral leadership stories

Preparation strategy (timeline)

Run DSA drills daily, practice one system design-lite prompt every two days, and sharpen behavioral narratives with metrics.

  1. 1.Week 1–2: Diagnose weak topics with timed quizzes; fix fundamentals.
  2. 2.Week 3–4: Daily medium DSA; one full mock coding assessment per weekend.
  3. 3.Week 5–6: Mock interviews with verbal narration; record answers and cut filler words.
  4. 4.Week 7+: Mixed panels (tech + behavioral) every 3–4 days; debrief with a simple error log.
  5. 5.Mid-cycle: One weekly retrospective — only redo patterns where you missed twice.
  6. 6.Final week: Two light mocks plus sleep hygiene; avoid brand-new hard topics.
  7. 7.Final 48h: Review your story bank and one page of complexity notes — confidence over volume.

Test your readiness

Can you solve questions asked in Google interviews under real clock pressure?

Coding-style prompt

Implement a function that returns the length of the longest substring without repeating characters — how would you explain the sliding window invariant to a Google interviewer?

Hint: O(n) with last-seen index map; articulate why left pointer only moves forward.

Sample MCQ

For a balanced BST with n nodes, which bound is typical for search time?

  • O(log n)
  • O(n)
  • O(1)
  • O(n log n)

Hint: Height is logarithmic when balanced.

Turn reading into performance

Take a full mock interview, get AI feedback on structure and clarity, and revisit weak areas — built for placement season when repetition beats passive reading.

  • Timed prompts similar to real campus panels
  • Actionable feedback on pacing and specificity
  • Progress-style practice you can repeat before each round

Thousands of candidates use InterviewForge for campus and early-career prep — combine this page with weekly mocks for best results.