HR interview questions
Googleyness/Leadership STAR frameworks and Hiring Committee prep.
Google Interview Experiences
Overview
Section titled “Overview”How Google’s SWE interviews actually run, based on aggregated candidate reports (Blind, Glassdoor, GeeksforGeeks) and Google’s own public hiring guidance. Team and level change the exact mix, so treat this as a prep map, not a script.
Reported total compensation for an India-based L3 new-grad hire varies widely by source - commonly cited in the ₹35-50 LPA range (base ₹18-25L plus RSUs and bonus), though some reports run notably higher with strong negotiation or competing offers. Treat any figure as a reported range, not a guarantee.
Round-wise process
Section titled “Round-wise process”| Stage | Duration | What it tests |
|---|---|---|
| Recruiter screen | 20-30 min | Background, logistics, timeline |
| Online Assessment (new grad/L3) | ~90 min | ~2 coding problems |
| Phone screen | 45-60 min | 1 coding problem, shared Google Doc |
| Onsite - Coding (2-3 rounds) | 45-60 min each | DSA, often non-standard phrasing |
| Onsite - System design (L5+) | 45-60 min | Distributed systems fundamentals |
| Onsite - Googleyness/Leadership | 45-60 min | Ambiguity, learning agility, influence without authority |
| Hiring Committee | 1-2 weeks | Independent packet review |
Real interview experiences
Section titled “Real interview experiences”Experience 1: SWE, new grad L3 (2025)
Section titled “Experience 1: SWE, new grad L3 (2025)”Profile: B.Tech CSE, competitive programming background, one internship, off-campus application
Online Assessment
- Longest palindromic substring (DP approach), and a range-sum query problem solved with a segment tree.
- Both needed an optimal solution - a working-but-slow answer wasn’t enough to advance.
Phone screen
- Implement a rate limiter, discussing fixed window vs sliding window vs token bucket before writing any code.
- Done entirely in a shared Google Doc - no autocomplete, no compiler, no way to test-run the code.
Onsite - coding
- Median of two sorted arrays, expected the O(log(min(m,n))) binary-search approach, not just the merge-and-find brute force.
- A second round asked for a URL-shortener-style hashing scheme mid-problem, testing whether the candidate would ask about scale unprompted.
Onsite - Googleyness
- “Tell me about a time you had to work through ambiguity with little direction.”
- “Describe a time you influenced a decision without having authority over the people involved.”
- Interviewer stayed largely silent between questions, following a fixed guide rather than a free-flowing conversation.
Hiring Committee
- All interviewer write-ups compiled into one packet; committee (outside the hiring team) reviewed it about a week after the onsite.
Result: Selected What helped: Narrating trade-offs out loud before touching the keyboard, and treating the Googleyness round as a real evaluation rather than small talk.
Experience 2: SWE, new grad L3 (2024-2025)
Section titled “Experience 2: SWE, new grad L3 (2024-2025)”Profile: B.Tech IT, strong personal projects, campus placement drive
What differed
- The online assessment leaned on graphs instead of DP: a BFS-based shortest-path variant with an added constraint that wasn’t in any textbook version.
- One onsite round shifted from coding into a lighter system-design discussion (distributed logging), even though the candidate was L3, not L5 - team-dependent variation in action.
- The Googleyness interviewer asked a direct follow-up on a “disagreement with a teammate” story: “What would you have done if they hadn’t agreed with you?”
Mistakes that hurt other candidates in the same cycle
- Writing code silently instead of narrating reasoning - interviewers can’t score an approach they can’t hear
- Treating “why Google” as a chance to praise Search or Gmail instead of naming a specific team or problem
- Giving up on a hard problem instead of stating a partial, correct approach with its complexity
Result: Selected Takeaway: Google’s format punishes silent coding and rewards a candidate who talks through trade-offs even when the final code isn’t perfect.
Questions that come up often
Section titled “Questions that come up often”Coding / technical
Section titled “Coding / technical”- Longest palindromic substring - dynamic programming
- Median of two sorted arrays - binary search, O(log(min(m,n)))
- Implement a rate limiter - fixed window / sliding window / token bucket
- Range-sum query data structure - segment tree
- Graph shortest-path variants - BFS with added constraints
System design (L5+)
Section titled “System design (L5+)”- Design a URL shortener
- Design a distributed cache
- Design a distributed logging/metrics pipeline
Googleyness / Leadership
Section titled “Googleyness / Leadership”- Tell me about a time you had to work through ambiguity with little direction
- Describe a time you influenced a decision without formal authority
- Tell me about a time you disagreed with a teammate’s approach
- Tell me about a time you learned a new technology or domain quickly
Practical tips for Google
Section titled “Practical tips for Google”- Practice in a plain-text editor with no autocomplete or run button - the format itself is part of what’s being tested.
- Narrate trade-offs out loud (hash map vs sort, BFS vs Dijkstra) before and while you code.
- Treat the Googleyness round as a scored interview, not a friendly chat - prepare real stories, not generic values statements.
- If a problem is genuinely hard, state a partial, correct approach with its complexity rather than going silent.
- Remember your interviewers don’t make the final call - staying consistent across every round matters more than one standout answer.
HR interview
Section titled “HR interview”After the technical rounds, Google’s Googleyness/Leadership round doubles as its behavioural evaluation, feeding directly into the Hiring Committee packet. Prepare those answers on the dedicated page rather than cramming them into this hub.