Reposted
Google · Onsite
In processGoogle Early Career Onsite via Referral: 1 Experience
Software engineer · New GradMaster's degreeJun 2025
Shared by
Google early career SWE onsite, June 2025: top-10 IPs from a file, minimum tree cut cost, and max subarray with equal endpoints; team match.
At a glance
- Process: a referral with no OA or phone screen, straight to four virtual onsite rounds split across June 10 and 18 (01).
- Asked recently: top-k IP addresses, minimum root-to-leaf cut cost, and maximum subarray with equal endpoints (01).
- Difficulty: not rated; follow-ups pushed each problem further (memory limits, N-ary trees, negative costs).
- Practise first: Top-K IP Addresses From File Records, Minimum Root-to-Leaf Cut Cost and Maximum Subarray Sum With Equal Endpoints.
Coverage: one Google software engineer new grad / early career candidate with a referral; onsite June 2025.
What came up
| Topic | Reports | Last seen |
|---|---|---|
| Heaps and counting | 1 of 1 | Jun 2025 |
| Tree DP | 1 of 1 | Jun 2025 |
| Prefix sums and hash maps | 1 of 1 | Jun 2025 |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Top-K IP Addresses From File Records | 1 | Jun 2025 |
| Minimum Root-to-Leaf Cut Cost | 1 | Jun 2025 |
| Maximum Subarray Sum With Equal Endpoints | 1 | Jun 2025 |
1 detailed candidate timeline
01: Straight to the onsite with a referral
Interview dates: June 10 and 18, 2025 · Role: Software Engineer, New Grad / Early Career · Application: referral · Result: in team match
- No OA or phone screen. Four virtual onsite rounds were split over two days after three sessions were rescheduled.
- Coding 1: a file of IP headers; return the ten most frequent IPs with a priority queue: Top-K IP Addresses From File Records. Follow-ups: group tied IPs by frequency (bucket style), and what to do when the file does not fit in memory.
- Coding 2: a tree cost problem solved with recursive DFS; follow-ups made the tree N-ary and allowed negative costs, so every valid combination of cuts had to be considered: Minimum Root-to-Leaf Cut Cost.
- Coding 3: find
i <= jmaximizing the sum ofa[i..j]witha[i] == a[j], values may be negative: Maximum Subarray Sum With Equal Endpoints. Brute force first, then a hash map with prefix sums. - Behavioral: standard experience and hypothetical questions. Nine days after the last round, recruiting confirmed team match and asked for a transcript.
Common questions
Can a referral skip the Google OA and phone screen?
Report 01 went straight to the four-round virtual onsite with a referral.
Keep practicing
- Top-K IP Addresses From File Records, Minimum Root-to-Leaf Cut Cost and Maximum Subarray Sum With Equal Endpoints: the three coding rounds from report 01.
- Google coding question bank and Google behavioral question bank (sign-in needed).
- Google interview guide and Google hiring insights: stages, practice problems and recent hiring signals.
- Experience feed: more interview reports from other companies and roles.
Sources: Anywhere useful interview info can be found.
0 total reactions. Your reactions: none.
0 comments
Comments
0No comments yet — be the first to share what you know.