RepostedGoogle logo

Google · Onsite

In process

Google New Grad NYC R2 Stream and Tree Rounds: 1 Experience

Software engineer · New GradMaster's degreeJan 2026
Shared by

Google new grad SWE R2 in New York, January 2026: first or last K from a stream, and rooting a graph as a binary tree with a color follow-up.

At a glance

  • Process: R2 onsite in New York City with two technical interviews; final result pending (01).
  • Asked recently: select the first or last |offset| items, then from a stream; find a valid binary-tree root of an acyclic graph, then a level-color follow-up (01).
  • Difficulty: the candidate found both easier than their R1 coding round, with a collaborative tone.
  • Practise first: Select First or Last K Stream Words and Alternating-Color Binary Tree Roots.

Coverage: one Google software engineer new grad candidate; R2 onsite in New York City, report January 2026.

What came up

Topic Reports Last seen
Streams and queues 1 of 1 Jan 2026
Trees and graphs 1 of 1 Jan 2026

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Select First or Last K Stream Words 1 Jan 2026
Alternating-Color Binary Tree Roots 1 Jan 2026

1 detailed candidate timeline

01: Two friendly technical rounds in New York

Report date: January 2026 · Role: Software Engineer, New Grad · Location: New York City onsite · Result: awaiting final result

Coding 1: signed-offset selection

  1. Given an array and an offset: a positive offset returns the first offset items; a negative one returns the last abs(offset) items. For [a,b,c,d,e], 2 gives [a,b] and -3 gives [c,d,e].
  2. Follow-up: the array becomes a stream with only hasNext() and getNext(), and the offset stays fixed. The last-k case used a queue. Select First or Last K Stream Words

Coding 2: binary tree root

  1. Given an undirected acyclic graph, decide whether it can be a valid binary tree and, if so, return its root.
  2. Follow-up: each node is black or white. Is there a valid binary-tree rooting where every depth level has a single color? Alternating-Color Binary Tree Roots
  3. The candidate found both rounds easier than their R1 coding and stressed working through them together with the interviewers.

Common questions

What does the Google new grad R2 onsite ask?

Report 01 had two coding interviews: first or last K items from a stream, and rooting an acyclic graph as a binary tree with a color follow-up.

Is Google R2 harder than R1 for new grads?

Report 01 found both R2 rounds easier than its R1 coding round.

Keep practicing

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.