Google · Phone screen → Onsite
In processGoogle SWE Intern Onsite Questions: 16 Experiences (Part 2 of 3)
Google Summer 2026 SWE intern interviews from Oct 2025 to Jan 2026: 16 reports, usually two coding rounds on graphs, trees, DP and intervals.
At a glance
- Process: six reports describe two coding rounds, 45 to 60 minutes each (14, 15, 17, 18, 25, 28); one candidate had a recruiter call and an OA first (23), and two talked with host teams or managers after the coding (20, 25).
- Asked recently: graph or tree problems in 5 of the 16 reports (13, 16, 18, 20, 23), DP in 4 (14, 17, 18, 26), and intervals, sweeps or heaps in 4 (19, 22, 25, 28).
- Difficulty: report 23 called both final questions LeetCode medium; report 14 said optimized code with time and space analysis was expected.
- Practise first: Maximum Currency Conversion With Arbitrage, Tree-Dependent Knapsack, The Skyline Problem and Minimum Classrooms for Courses.
Coverage: 16 Google SWE, SDE and PhD SWE/SDE intern candidates (reports 13–28), technical screens and virtual onsites, report dates October 16, 2025 to January 7, 2026. Locations named: New York, the United States and Shanghai. Dates are report dates unless an interview date is given.
In this series
- Part 1: the overview, four OA reports and reports 05–12.
- Part 2 (current): reports 13–28, October 2025 to January 2026.
- Part 3: reports 29–42, January–February 2026.
What came up
Most candidates here met one graph or tree problem and one array or DP problem, with a follow-up that changed the rules. Counts are out of 16; one candidate can be in several rows.
| Topic | Reports | Last seen |
|---|---|---|
| Graphs and trees | 5 of 16 | Dec 2025 |
| Dynamic programming | 4 of 16 | Dec 2025 |
| Intervals, sweeps and heaps | 4 of 16 | Jan 2026 |
| Hash maps and sets | 3 of 16 | Jan 2026 |
| Strings | 3 of 16 | Dec 2025 |
| Behavioral or hiring-manager talk | 3 of 16 | Dec 2025 |
| Greedy and matching | 2 of 16 | Dec 2025 |
| Backtracking | 1 of 16 | Nov 2025 |
Questions we found
Each question came from one candidate in this part. "Reconstruction" means the candidate only described the idea, so our practice version is a close stand-in, not the exact prompt.
Graphs, trees and search
| Question | Reports | Last seen |
|---|---|---|
| Flood Fill (LeetCode 733) | 1 | Dec 2025 |
| Subsets (LeetCode 78) | 1 | Nov 2025 |
| Number of Islands (LeetCode 200) | 1 | Nov 2025 |
| Tree-Dependent Knapsack | 1 | Nov 2025 |
| Transform and Prune a Mode-Valued Binary Tree | 1 | Oct 2025 |
| Maximum Currency Conversion With Arbitrage | 1 | Oct 2025 |
| Unnamed Dijkstra shortest-path problem | 1 | Sep 2025 (interview) |
Arrays, strings and DP
| Question | Reports | Last seen |
|---|---|---|
| Maximum Product Subarray (LeetCode 152) | 1 | Dec 2025 |
| Longest Duplicate Substring (LeetCode 1044) | 1 | Dec 2025 |
Shuffle a list using random.randint() |
1 | Dec 2025 |
| Run-Length Encode a String (reconstruction) | 1 | Dec 2025 |
| Lexicographically Smallest Array With K-Limited Right Moves | 1 | Nov 2025 |
| Maximum Subarray Sum With Equal Endpoints | 1 | Nov 2025 |
| Swap Two Numbers | 1 | Oct 2025 |
| Russian Doll Envelopes (LeetCode 354) | 1 | Oct 2025 |
| Next Greater Numerically Balanced Number (LeetCode 2048) | 1 | Oct 2025 |
| Next Time Using the Same Digits | 1 | Sep 2025 (interview) |
Intervals, heaps, streams and matching
| Question | Reports | Last seen |
|---|---|---|
| Most Active Caller by Distinct Contacts | 1 | Jan 2026 |
| Batch Point-in-Range Queries | 1 | Jan 2026 |
| Maximum Programmer-Problem Matching | 1 | Dec 2025 |
| Maximum Tea Deliveries With Minimum Distance | 1 | Dec 2025 |
| Minimum Classrooms for Courses | 1 | Dec 2025 |
| The Skyline Problem (LeetCode 218) | 1 | Dec 2025 |
| Cross-Day Object and Client Log Intersection | 1 | Nov 2025 |
| First Unique Event in a Stream (reconstruction) | 1 | Nov 2025 |
| Stable Top K Frequent Words (reconstruction) | 1 | Nov 2025 |
16 detailed candidate timelines, loops, and screens
Newest first. The numbers continue from Part 1 and carry on in Part 3.
28: Two Shanghai rounds with very different interviewers
Report date: January 7, 2026 · Role: SWE Intern · Level: Bachelor's · Location: Shanghai · Result: No offer
- Round one opened with a short greeting in Chinese, then moved to English: Most Active Caller by Distinct Contacts. "Most active" meant the most different people contacted, not the most messages.
- Round two stayed in Chinese, started with project questions, and then asked Batch Point-in-Range Queries: for each query value, which may be a decimal, say whether it falls inside any of the given ranges. Scale and complexity came next.
The candidate's takeaway: ask what kind of numbers the input holds instead of assuming integers.
27: Tag matching, then tea deliveries on a line
Report date: December 20, 2025 · Role: PhD SDE Intern · Result: No offer
- Maximum Programmer-Problem Matching: match programmers to questions that share a tag. The candidate started with brute force and sped up the lookup with a hash map. A priority-queue follow-up was mentioned without detail.
- Maximum Tea Deliveries With Minimum Distance: people and tea shops sit on a line; each person and each shop handles at most one delivery, within distance five. Deliver as many as possible, then, among the best answers, keep the total distance smallest. The key was spotting a greedy matching structure rather than reaching for a general graph method.
26: A medium coding question plus behavioral and manager rounds
Report date: December 16, 2025 · Role: SWE Intern · Result: Declined offer
- Several rounds, including behavioral and hiring-manager conversations.
- The coding question was Maximum Product Subarray, worked through interactively with the interviewer.
25: Course intervals that turned into a calendar layout
Report date: December 10, 2025 · Role: Software Engineering Intern 2026 · Location: Shanghai · Result: Team matched
- Two interviews on the same day, 11:00–11:45 and 13:00–14:00, with coding in a shared document, debugging and step-by-step changes.
- The afternoon problem ended as a calendar-layout task (drawing event rectangles). The interviewer first split out a clean subtask: Minimum Classrooms for Courses. The layout part was not described in enough detail to rebuild.
24: Longest duplicate substring and a shuffle follow-up
Report date: December 6, 2025 · Role: PhD SWE Intern
- Round one was Longest Duplicate Substring.
- A later follow-up asked how to shuffle a list using
random.randint(). The candidate did not give enough detail for a separate practice problem.
23: Recruiter call, OA, then Flood Fill
Report date: December 5, 2025 · Role: Software Engineer Intern · Result: Offer
- A recruiter call, then an online assessment, then two final questions the candidate called LeetCode medium.
- One was Flood Fill. The other was not named.
22: An easy warm-up before Skyline
Report date: December 4, 2025 · Role: PhD SWE Intern · Stage: Additional interview
- A deliberately easy string-processing opener. The exact task was not shared; Run-Length Encode a String is our reconstruction.
- The main question was The Skyline Problem, solved with the usual sweep line and heap.
21: Two days of logs with limited memory
Report date: November 28, 2025 · Role: PhD SDE Intern · Result: Pass
- Cross-Day Object and Client Log Intersection: two daily logs of
(timestamp, objectId, clientId). Return the object IDs that appear on both days and were used by at least two clients. - Follow-ups: the cost of the set intersection, then a version for limited memory using sorting and two pointers.
20: Backtracking, islands and three manager calls
Report date: November 10, 2025 · Role: SWE Intern · Location: United States · Result: Declined offer
- The process covered coding, behavioral questions, two technical rounds, project matching and conversations with three managers.
- The named questions were Subsets, solved with backtracking, and Number of Islands, solved with graph traversal.
Passing the technical rounds and finding a host team were separate steps here.
19: Sort an array when right moves are limited
Report date: November 8, 2025 · Role: PhD SWE Intern
- The first problem: make an array as sorted as possible when each element may move right by at most
kplaces but left by any amount. Our version is Lexicographically Smallest Array With K-Limited Right Moves. - The other two were only described by technique: a stream task using a deque plus a hash map, and a standard heap-based top-k task. Our stand-ins are First Unique Event in a Stream and Stable Top K Frequent Words.
18: A knapsack on a tree
Report date: November 7, 2025 · Role: PhD SWE Intern · Result: Pass
- Two 45-minute interviews in one morning.
- The question shared was Tree-Dependent Knapsack: items form a tree, and picking an item means its parent must be picked too.
- The two interviewers felt very different: one stayed mostly quiet, the other was engaged and moved through several tasks.
17: Maximum subarray with equal ends
Report date: November 5, 2025 · Role: Software Engineer Intern · Result: Offer
- Two interviews in a LeetCode style.
- One was Maximum Subarray Sum With Equal Endpoints: the best-sum contiguous range whose first and last values are equal, which allows a Kadane-like speed-up.
- A second, string-parsing task was mentioned without details.
16: Flip a tree, find the mode, prune
Report date: October 29, 2025 · Role: Software Development Intern · Length: 45 minutes
- Transform and Prune a Mode-Valued Binary Tree: replace each value with its reciprocal, swap every left and right child, find the most common value (the mode), then delete each subtree whose root holds the mode. The interviewer added a check for division by zero.
- The last follow-up was small: Swap Two Numbers.
15: The next clock time with the same digits
Report date: October 27, 2025 · Interview date: September 2025 · Role: Software Engineer Intern · Result: No offer
- Two 50-minute technical interviews, with one behavioral question before the coding.
- Next Time Using the Same Digits: find the next valid clock time that uses exactly the same four digits. The example given was
09:25 → 20:59, although09:52would come earlier; our version follows the "next valid time" rule. - A second question used Dijkstra's shortest-path algorithm; the candidate did not describe it further.
14: Two optimized classics in New York
Report date: October 26, 2025 · Role: SWE Intern · Location: New York · Result: Offer
- Two remote coding rounds. Optimized code plus time and space analysis were expected.
- Russian Doll Envelopes: sort by width, then find the longest increasing run of heights.
- Next Greater Numerically Balanced Number.
13: Currency conversion with a profitable loop
Report date: October 16, 2025 · Role: SWE Intern · Level: Bachelor's
- Maximum Currency Conversion With Arbitrage: given exchange rates as directed edges, find the most money you can end with when converting from one currency to another over several hops.
- The follow-up mattered most: if a profitable cycle can be reached, the answer has no upper limit, so a plain "visited" DFS is not enough.
Patterns across the reports
- Two coding rounds. Reports 14, 15, 17, 18, 25 and 28 each describe two technical interviews. Lengths given: 45 minutes (18), 50 minutes (15), and 45 plus 60 minutes on one day (25).
- The follow-up changes the problem. A profitable cycle (13), a division-by-zero check (16), limited memory (21), a shuffle after the main task (24) and a calendar layout grown from an interval count (25).
- Team matching after the loop. Reports 20 and 25 both went on to talk with teams or managers after the coding rounds.
- Interviewers vary. Report 18 had one quiet and one engaged interviewer; report 28 had one round in English and one in Chinese.
Common questions
How many rounds is the Google SWE intern interview?
Six of these 16 reports describe two technical rounds (14, 15, 17, 18, 25, 28). Report 20 also mentions behavioral questions, project matching and three manager calls.
How long is each Google intern coding interview?
45 minutes in 16 and 18, 50 minutes in 15, and 45 plus 60 minutes in 25.
Does the Google SWE intern process include an OA?
Only report 23 in this part mentions one, after a recruiter call. The OA reports are in Part 1.
What happens after the Google intern coding rounds?
Report 20 had project matching and calls with three managers; report 25 ended with a team match.
What to practise
- Maximum Currency Conversion With Arbitrage. The profitable-cycle follow-up in report 13 is the hardest twist in this part.
- Tree-Dependent Knapsack and Maximum Product Subarray. DP appears in 4 of the 16 reports (14, 17, 18, 26).
- The Skyline Problem and Minimum Classrooms for Courses. Interval and sweep questions came up in 22 and 25.
Keep practicing
- Flood Fill and Number of Islands: the graph questions from reports 23 and 20.
- Cross-Day Object and Client Log Intersection: the memory-limited log question from report 21.
- Google coding question bank: every Google coding problem on FastPrep (sign-in needed).
- Google interview guide: the Google interview stages with practice problems for each.
- Google hiring insights: recent application, interview and offer signals for Google.
- Experience feed: more interview reports from other companies and roles.
In this series: Part 1 · Part 2 (current) · Part 3
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.