RepostedGoogle logo

Google · OA → Phone screen → Onsite

In process

Google New Grad SWE Interview Questions Guide (Part 1 of 2)

Software engineer · New GradSep 2026
Shared by

Google new grad SWE question guide from 196 reports, 2023–2026: two repeated OA pairs, a restaurant waitlist task and follow-ups that change the rules.

At a glance

  • Process: an OA (two coding tasks, around 90 minutes, no camera in some windows), then live coding rounds where the follow-up often changes the contract, plus Googleyness and behavioral questions.
  • Most repeated: OA pairs: moving tokens with a common-digit group (9 reports each) and Split and Sort with Minimum Absolute Sum (5 each). Live: Restaurant Waitlist (7), Meeting Rooms II (4), and three tasks seen three times each.
  • Difficulty: most live questions appeared only once, so the long tail is wide; follow-ups (streaming, updates, memory, scale) were where candidates were tested.
  • Practise first: Restaurant Waitlist, Minimum Absolute Sum and Filesystem Entity Total Size.

Coverage: A question guide built from 196 deduplicated Google new grad and early-career software reports (181 general SWE, 13 MLE, one frontend, one data engineering) published March 2023 to September 2026. The counts show how many independent reports named each question.

In this series

  • Part 1 (current): repeated OA and live-coding questions and the patterns behind them.
  • Part 2: every behavioral and Googleyness question that 79 of the reports disclosed.

High-frequency online-assessment questions

OA 01: Moving tokens and grouping by a common digit — 9× each

These two questions repeatedly appeared together.

Moving tokens

  1. The board is represented as a one-dimensional string containing empty cells, tokens, and coins.
  2. A token moves exactly three positions to the right and may move more than once.
  3. A move is blocked when another token occupies the destination.
  4. A coin is collected only when a token lands on it.
  5. Return the maximum number of coins that can be collected.

Practice: Maximum Coins With Moving Tokens (practice page needs sign-in)

Common-digit group

  1. The input contains two-digit numbers.
  2. Select the largest group whose members all contain one common digit.
  3. A repeated digit inside one number still counts that number only once.

Practice: Maximum Elements With a Common Digit (practice page needs sign-in)

One source displayed a contradictory example for the common-digit task and never resolved it. The practice page keeps the coherent contract instead of silently copying that example.

OA 02: Split and Sort plus Minimum Absolute Sum — 5× each

These two tasks formed the second repeated OA pair.

Split and Sort

Choose a cut between two array elements. Sort the left and right pieces independently, concatenate them, and count the cuts that make the final array nondecreasing. The reported linear approach compares each prefix maximum with the next suffix minimum.

Practice: Count Sortable Splits

Minimum Absolute Sum

Given an integer array, negate at most one element so the absolute value of the total sum is as small as possible. If the original total is S and the chosen value is x, the new total is S - 2x.

Practice: Minimum Absolute Sum

Some reports described a 90-minute assessment, no camera, and the ability to add custom tests. Those details belonged to specific recruiting windows, not one permanent Google-wide rule.

High-frequency live-interview questions

01: Restaurant Waitlist — 7×

Candidates maintained waiting parties and selected a party when a table became available. Reported operations included joining, leaving, and serving the earliest suitable party.

The reports did not preserve one universal matching policy. Some used an exact party-to-table size; others allowed a smaller party to take a larger table. Follow-ups covered deletion, rejoining, duplicate reservations, complexity, concurrency, and how the design might extend to a queueing system.

Practice: Restaurant Waitlist

02: Meeting Rooms II / minimum chairs — 4×

Candidates detected interval overlap or returned the maximum number of simultaneous meetings. The repeated solution family used sorted endpoints or a min-heap of active ending times.

Practice: Minimum Number of Chairs / Meeting Rooms II

03: Count wrapped document lines — 3×

Given text and a width limit, return the number of display lines. Richer versions introduced explicit newlines, whitespace, words longer than the width, or a two-column follow-up.

Practice: Count Lines in a Width-Limited Document

04: Filesystem entity total size — 3×

Model files and directories as a tree and compute the total size below a directory. Follow-ups asked how to answer repeated size queries efficiently or update every affected ancestor when a file changes.

Practice: Filesystem Entity Total Size

05: Top-K IP addresses from a large file — 3×

Read IP-address records, count frequencies, and return the most common addresses. Follow-ups covered ties and a file too large to fit in memory.

Practice: Top-K IP Addresses from File Records

Questions with two independent sightings

Each family below appeared in two independent experiences. Two sightings are useful corroboration, but not enough to call the prompt standard.

Question family Reported task
Biggest Number From Digits Arrange or select supplied digits to form the largest valid result.
Calculator with Parentheses Parse and evaluate arithmetic containing parentheses; the supported operators varied.
Check Inequality Constraint Consistency Decide whether all ordering constraints can hold simultaneously.
Count Islands After Land Additions Add land over time and report the changing number of connected islands.
Deduplicate Card-Pile Prefixes Remove previously seen card values from later pile prefixes, then generalize to more piles.
Group Shift-Equivalent Strings Group strings sharing the same cyclic letter-shift pattern.
Guess the Word Find a hidden word through bounded interactive similarity feedback.
Maximum Subarray Sum with Equal Endpoints Maximize a subarray sum whose endpoint values are equal.
Minimum Data Chunks with an Indivisible Header Split data into bounded chunks while keeping a header intact.
Recover Coins from Change Counts Reverse a coin-change DP table to recover a possible coin set.
Streamed Scalar Item Triplets Process streamed items and emit qualifying triplets under the reported scalar rule.
Sum Two Piecewise-Constant Time Series Merge timestamped value changes and output their pointwise sum.
Top K Frequent Elements Return the most frequent values with a heap or bucket strategy.
Transform L/R Pieces on a Circular Board Decide whether directional pieces can reach a target arrangement on a wrapping board.
Validate a Simplified Mahjong Winning Hand Decide whether a fixed-size numeric hand can form the required melds and pair.

Patterns that repeated across different coding questions

Follow-ups changed the contract

At least 80 original-author reports explicitly mention a follow-up or changed requirement. The recurring moves were:

  1. Turn a batch problem into an online or streaming problem.
  2. Support updates, deletions, or repeated queries.
  3. Reduce O(n) extra space or improve an O(n log n) solution.
  4. Handle input that no longer fits in memory.
  5. Add ordering, tie-breaking, duplicate, concurrency, or fault-tolerance rules.
  6. Explain how the design changes when one hidden assumption is removed.

Interviewers checked alignment, not silent coding

At least 37 candidates explicitly discussed clarification, alignment, communication, or thinking aloud. Reports repeatedly describe interviewers recording whether the candidate clarified the input and output, tested examples, explained a pivot, or checked that both sides were solving the same problem.

This did not mean talking continuously. The stronger pattern was short alignment points: restate the contract, name the invariant, explain the chosen structure, and say what changed when a follow-up arrived.

Complexity questions were specific

At least 32 reports mention complexity analysis. Some interviewers wanted more than a single O(n log n) label: they asked what each variable represented, how heap operations contributed, whether result construction added another term, and what happened when the data became too large for memory.

The live bank is a long tail

Only five live-question families appeared at least three times. Most named questions were seen only once. System Design, ML design, and role-specific domain questions were even less repetitive.

That is the main limitation of any Google “high-frequency” list: it identifies the few questions that genuinely repeated, but it does not turn an unusually broad interview bank into a predictable one.

What to practise

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.