Reposted
Google · Onsite
In processGoogle L4 PhD New Grad Europe Onsite: 1 Experience
Software engineer · New GradDoctorateJul 2026
Shared by
Google L4 PhD new grad onsite in Europe, 2026: a template across tree leaves, one-two strings, top-k IPs and programmer-problem matching.
At a glance
- Process: three coding rounds and a behavioral round with interviewers mostly in the UK or Poland; waitlisted in team match (01).
- Asked recently: a template across binary-tree leaves, one-two strings with sum N, top-k IPs from a large file and programmer-problem matching (01).
- Difficulty: manageable; clear communication mattered more than difficulty. European team match was the hard part.
- Practise first: Maximum Programmer-Problem Matching and Top-K IP Addresses From File Records.
Coverage: one Google software engineer PhD new grad (L4, Europe) candidate; reported July 2026.
What came up
| Topic | Reports | Last seen |
|---|---|---|
| Trees and string matching | 1 of 1 | Jul 2026 |
| Backtracking | 1 of 1 | Jul 2026 |
| Heaps and counting | 1 of 1 | Jul 2026 |
| Bipartite matching | 1 of 1 | Jul 2026 |
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Find a Template Across Binary-Tree Leaves | 1 | Jul 2026 |
| Generate One-Two Strings With Sum N | 1 | Jul 2026 |
| Top-K IP Addresses From File Records | 1 | Jul 2026 |
| Maximum Programmer-Problem Matching | 1 | Jul 2026 |
System Design
| Question | Reports | Last seen |
|---|---|---|
| Distributed streaming skill matching (follow-up) | 1 | Jul 2026 |
1 detailed candidate timeline
01: Four problems and a hard European team match
Report date: July 2026 · Role: Software Engineer, PhD New Grad (L4, Europe) · Result: waitlisted in team match
- Interviewers were mostly in the UK or Poland. The questions felt manageable; communication mattered more than difficulty. Behavioral questions were familiar.
- Coding 1: each leaf of a binary tree (said to come from an HTML file) holds a string, character or space; join the leaves and check whether a template appears: Find a Template Across Binary-Tree Leaves. Brute-force matching was accepted, with complexity.
- Coding 2: output every string of
1s and2s that sums toN, with exact complexity (Generate One-Two Strings With Sum N); then thekmost frequent IPs in a gigabyte-scale file (Top-K IP Addresses From File Records). - Coding 3:
Nproblems with tags andMprogrammers with skills; a programmer can take a problem if a skill matches a tag, each at most once. Find any feasible assignment: Maximum Programmer-Problem Matching. Follow-ups, discussed only: maximize matches with bipartite matching, then distribute it and support streaming. - The candidate found European team match especially hard.
Common questions
Who interviews for Google L4 PhD roles in Europe?
Report 01's interviewers were mostly based in the UK or Poland.
Keep practicing
- Maximum Programmer-Problem Matching and Find a Template Across Binary-Tree Leaves: two of the coding rounds from report 01.
- Google coding question bank and Google system design 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.