Google SWE II (Early Careers) — Full 4-Round Experience with Feedback Per Round
Summary
I completed Google's SWE II (Early Careers) interview loop, which consisted of four rounds covering Trie/HashMap, Graphs/DSU, DP/Binary Search, and Googliness, and received Strong Hire/Hire outcomes before entering team matching.
Full Experience
I recently went through the Google SWE II (Early Careers) loop and documented the full experience — all 4 rounds with the topics asked, what went well, and what didn't.
Quick summary:
Round 1 (Trie + HashMap) — Strong Hire Round 2 (Graphs + DSU modification) — Strong Hire Round 3 (DP + Binary Search optimization) — Hire Round 4 (Googliness + DSA) — Lean Hire Currently in team matching.
I wrote a detailed breakdown here with tips for each round: https://beyondleet.dev/experiences/google-swe2-early-careers-2026
Also started documenting the actual questions asked (with constraints, examples, and follow-ups that interviewers asked):
- https://beyondleet.dev/questions/trie-hashmap-string-matching
- https://beyondleet.dev/questions/modified-union-find-graph-components
- https://beyondleet.dev/questions/dp-to-binary-search-optimization
Hope this helps anyone preparing for Google. Happy to answer questions.
Interview Questions (3)
Trie & HashMap String Matching
A problem involving string matching using a combination of Trie and HashMap data structures.
Modified Union-Find Graph Components
A graph problem that requires modifications to the Union-Find (DSU) structure to identify components.
DP to Binary Search Optimization
An optimization task converting a dynamic programming solution into one that leverages binary search.