Google SDE New Grad — 4 rounds, selected
- Role
- Software Engineer
- Level
- Fresher
- Year
- 2026
- Location
- Bengaluru
- Mode
- On-site
- Rounds
- 4 · 5 questions
Online assessment followed by three virtual coding interviews and a Googleyness round. Interviewers cared about clear communication and testing edge cases.
Online assessment
Online Assessment
2 problems in 90 minutes.
Q1.Find the longest substring with at most K distinct characters.
Sliding window with a hashmap.
Sliding WindowHashingQ2.Minimum cost to connect all cities.
Kruskal with union-find.
GraphsUnion Find
Technical
Coding Interview 1
45 minutes on Google Docs.
Q1.Design an iterator that flattens a nested list.
Stack-based lazy approach was expected.
StacksDesign
Technical
Coding Interview 2
Graph-heavy round.
Q1.Given a grid of 0s and 1s, find the shortest path removing at most one obstacle.
BFS with state (row, col, removed).
BFSGraphs
HR
Googleyness & Leadership
Behavioural.
Q1.Tell me about a time you disagreed with a teammate.
STAR format worked well.
Behavioural
Tips
Talk through brute force first, then optimise. Always write test cases before saying you are done.
Shared by Intersect team.
Discussion (0)
Sign in to join the discussion.