← Back to Dashboard

Google Interview Questions

Curated from verified interview reports: a 100% Full-match Coding slate - graph/segment problems, linked-list manipulation, tokenizers, and simplifiers.

9 real interview questions reported from Google Software Engineer interviews (Coding round): 6 medium, 3 hard. Each question shows its interview round and how often it was reported, and coding questions come with runnable tests.

Google Coding round questions (9)

  • Daily Branch Pruning - Medium, free preview
    Group tree nodes by the day they would disappear if all current leaves were pruned at once.
  • Dual Extremes Queue - Hard, free preview
    Design a FIFO buffer that supports enqueue, dequeue, and constant-time min/max queries.
  • Expression Simplifier - Hard
    Remove parentheses from an algebraic expression while distributing signs correctly and preserving term order.
  • Largest Island Perimeter - Medium
    Scan a binary grid and return the maximum perimeter achieved by any connected island.
  • Longest Match Tokenizer - Medium
    Tokenize text greedily using the longest dictionary match at each position.
  • Minimum Tires for a Race - Hard
    Choose when to keep using a degrading tire versus paying a change penalty to finish a race in minimum total time.
  • Reverse Segment of Linked List - Medium
    Reverse the second half of a linked list, then weave the two halves together alternately.
  • Running Tests With Failing Pairs - Medium
    Use a black-box test oracle to recover every incompatible pair of test cases.
  • Unpainted Segments - Medium
    For each paint operation, report how much brand-new length was covered before updating the wall.