Google · Onsite
In processGoogle SWE Intern Return Offer: 5 Experiences (Part 7 of 8)
Google SWE accounts from Sep–Oct 2026: 5 reports, including an hour-long first-fit memory allocator round and a PhD intern's new-grad return offer.
At a glance
- Process: three accounts describe two back-to-back interviews (74, 77, 78). Passing them led to Project Search, Google's host-team matching step, in 77 and 78.
- Asked recently: a first-fit memory allocator and an unnamed graph min/max task (74), a record-lookup question without sorting or searching (75), and two medium questions that were not LeetCode copies (76).
- Difficulty: 74 found the allocator too much for 45 minutes; 77 rated one question medium-to-hard and two medium; 76 called both questions medium.
- Practise first: First-Fit Memory Allocator and Indexed Person Record Queries.
Coverage: five Google accounts posted in September–October 2026: a 2027 PhD SWE intern interview (74), a PhD candidate's Summer 2026 internship and 2027 new-grad return offer (77), and three commenters whose role or cohort is not stated (75, 76, 78). Locations are not given.
In this series (Google 2027 intern tracker)
- Part 1: graphs and OOD
- Part 2: paths, grids, trees
- Part 3: prefix sums and heaps
- Part 4: loops and team matching
- Part 5: grids, DP, OOP and AI
- Part 6: trees and knapsack
- Part 7 (current): PhD rounds and return offers
- Part 8: updates and host calls
- Companion: extra interview rounds
What came up
Only two of the five accounts named a coding topic; the rest describe difficulty, format or the matching step.
| Topic | Reports | Last seen |
|---|---|---|
| Two back-to-back interviews | 3 of 5 | Oct 2026 |
| Project Search and team matching | 2 of 5 | Sep 2026 |
| Memory allocation and linked lists | 1 of 5 | Oct 2026 |
| Graphs (min/max task, unspecified) | 1 of 5 | Oct 2026 |
| Indexing and lookup by field | 1 of 5 | Oct 2026 |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Indexed Person Record Queries | 1 | Oct 2026 |
| First-Fit Memory Allocator | 1 | Oct 2026 |
| Graph min/max problem (not specified) | 1 | Oct 2026 |
5 detailed candidate timelines, loops, and screens
Newest first. The numbers continue across the tracker.
75: Find matching records without sorting or searching
Comment date: October 22, 2026 · Round: second interview · Role and cohort: not stated
- The interviewer, who had a mathematics PhD, described a dataset of several thousand people, each with fields such as an ID and a name. The task: find the records that match given field values, without sorting or searching.
- The commenter's first idea was to load the data into a database and write a SQL query, and they asked others what the right answer was. The post's author suggested a search-engine-style index, while saying they were not sure; the commenter stayed unsure what the interviewer wanted.
- Our practice version is Indexed Person Record Queries: fixed records, exact-match AND conditions, indexes built ahead of time, and results as row positions. It reads "no sorting or searching" as no full scan and no binary search per query. Those details are our choice, not confirmed by the commenter.
74: An hour on a first-fit memory allocator
Report date: October 21, 2026 · Role: Google 2027 PhD SWE Intern · Format: two back-to-back interviews
Round 1: memory management
- The interviewer gave a struct like
BlockHeader, withsize_t size, a free flag andnext/prevpointers, then walked the candidate through writing a class, its fields, a constructor andmallocover a buffer. - Rules: ignore alignment, no C++
new, and use the doubly linked list to find the first free block big enough for a request, splitting off the unused space. That is the core of First-Fit Memory Allocator. Our version simulates addresses as offsets and spells out free and merge rules that the interview did not fully give. - The candidate spent about an hour on it, had not done memory management in years, and only reached pseudocode for
free. The interviewer kept prompting them to keep writing, which felt helpful, but the task seemed too big for 45 minutes.
Round 2: a graph min/max problem
- Described only as a normal min/max graph question; no model or goal was shared.
- The interviewer asked the candidate to write their own method signature and gave almost no signal on whether the solution was right. There was no dry run.
- Timing slipped: round one ran five to eight minutes into round two, the second interviewer stepped out for about five minutes, and then allowed a ten-minute extension.
This candidate's earlier 2025 interview and renewed recruiter contact are covered in Part 6. No decision was reported.
76: Two medium questions, result pending
Comment date: October 21, 2026 · Role and cohort: not stated
- The commenter had finished interviewing a day or two earlier and got two medium coding questions.
- Asked whether they were straight from LeetCode, they said no. They did not share the questions or a result.
78: A team-matching email three days after asking
Update date: September 24, 2026 · Employment: internship · Status: team matching
- On September 21, the commenter asked how long feedback takes after two back-to-back internship interviews.
- On September 24, they said they had just received an internship team-matching email.
- The post's author replied that a Project Search notice means the technical interviews were passed, and compared host matching to a PhD student and an advisor choosing each other. No questions, match or offer were reported.
77: A Summer 2026 PhD internship, then a 2027 new-grad return offer
Report date: September 19, 2026 · Internship interviews: October 27, 2025 · Return cohort: 2027 new grad · Result: return offer received
Internship application
- Oct 3, 2025: applied with a referral.
- Oct 27: two back-to-back interviews. Round one had one question the candidate rated medium-to-hard, with follow-up discussion, and ended with one or two behavioral questions that felt like a chat. Round two had two medium questions with follow-ups and no small talk; time was tight. None of the questions were named.
- Nov 6: entered Project Search, which the candidate took as the sign the technical rounds were passed.
- Nov 11–18: HR set up the first team-matching call (Nov 12), and the match succeeded on Nov 18.
- Nov 19: identity verification, an HR call and the final internship offer.
Return offer
- Aug 28, 2026: last day of the internship.
- Sep 4: offer approval and identity verification.
- Sep 18: final return offer, with an invitation to review and sign. (The candidate's timeline writes this date with a year typo.) Acceptance was not reported. The candidate described a supportive host and team.
Patterns across the reports
- Two interviews in a row. Reports 74, 77 and 78 all describe two back-to-back interviews.
- Project Search means the coding is passed. Both 77 and 78 treat the Project Search notice as the sign the technical rounds were cleared.
- Not LeetCode copies. Report 76 said its questions were not taken from LeetCode, and 74's allocator was a guided, open-ended build.
Common questions
What does Project Search mean in the Google intern process?
In reports 77 and 78 it came after the technical interviews and meant they had passed; host-team matching calls followed (77).
How long from Google intern interviews to an offer?
Report 77 interviewed on October 27, 2025, entered Project Search on November 6, matched a team on November 18 and had the offer on November 19.
How hard are Google PhD intern coding interviews?
Report 74 could not finish a memory allocator in 45 minutes; report 77 rated one question medium-to-hard and two medium.
Can a Google intern get a new-grad return offer?
Report 77 did: the internship ended August 28, 2026, and the 2027 new-grad return offer came on September 18.
Keep practicing
- First-Fit Memory Allocator: round one of report 74.
- Indexed Person Record Queries: the record-lookup question from report 75.
- 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 · Part 3 · Part 4 · Part 5 · Part 6 · Part 7 (current) · Part 8
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.