google logo
Google· SDE III

Google Interview Experience (L5) — 8+ YOE

Experience
8 years
Posted
30 Jun 2025
437 reads

Summary

I interviewed for an L5 Staff Software Engineer role at Google with over 8 years of experience. Despite passing the qualifying round and solving problems in subsequent rounds, I ultimately received a 'No Hire' for both L5 and L4 positions. The interviews covered topics from HashMap internals and expression evaluation to interval management and concurrent user counters.

How it went

Interview Experience – L5

YOE: 8+ years
Prep time: ~4 months
Language: Java


Qualifying Round

Question:
Implement the internal workings of a HashMap.
(The question was indirect, not "implement HashMap" literally.)

My approach:

  • Explained hashing, collision resolution (separate chaining), resizing.
  • Discussed load factor, capacity thresholds.
  • Answered all follow-ups thoroughly.

Verdict:

  • Self-assessment: ✅ Strong hire
  • Actual: ✅ Passed

Notes:
Understand not just how to implement, but why you choose a collision strategy and resizing approach.


Round 1

Question:
Given an expression, insert + and * operators to evaluate to a target.

My approach:

  • Used DFS/backtracking to explore all operator placements.
  • Built expression string carefully.
  • Explained time and space complexity.

Follow-ups:

  • Handling 0 (leading zeros).
  • Handling negative numbers.

Outcome:

  • Solved all parts in the interview.

Verdict:

  • Self-assessment: ✅ Strong hire
  • Actual: ❌ No hire

Notes:
Even if you solve the problem, interviewers will still evaluate how clearly you explain your reasoning, handle edge cases, and write clean code.


Round 2

Question:
Given employee names with entry and exit times, for specific times, find how many employees are present.

My approach:

  • Took some time clarifying the problem.
  • Used sorting and line-sweep technique.
  • Completed core logic.

Issue:

  • Ran out of time for follow-up questions.
  • Made mistakes explaining time complexity.

Verdict:

  • Self-assessment: ✅ Hire
  • Actual: ❌ No hire

Notes:
Make sure you can clearly and quickly explain your time/space analysis. Practice summarizing approaches like line-sweep and prefix sums under time pressure.


Round 3

Question:
How would you implement a counter for a given userId?
(uId, counter) map

Follow-ups:
Handling in a multi-threaded environment.

My approach:

  • Suggested using a basic map.
  • Mentioned ConcurrentHashMap.
  • Talked about AtomicInteger per user.
  • Discussed synchronized blocks.

Verdict:

  • Self-assessment: ✅ Hire
  • Actual: ❌ No hire

Notes:
Concurrency questions often require deep understanding of Java primitives. Be ready to discuss race conditions, consistency guarantees, and practical implementation details.


Final Verdict

  • L5: ❌ No hire
  • Also tried for L4: ❌ No hire

Key Takeaways

  • Master fundamentals like HashMap internals, DFS/backtracking, interval/line-sweep techniques.
  • Always explain time and space complexity clearly and confidently.
  • Be fast at clarifying problem statements to avoid losing time.
  • Practice multi-threading patterns in your chosen language, including specifics like ConcurrentHashMap and AtomicInteger.
  • Don’t just “make it work” — be able to explain why your approach is correct and optimal.

Questions asked (4)

  1. 01

    Implement HashMap Internals

    Data Structures & Algorithms

    Implement the internal workings of a HashMap. (The question was indirect, not "implement HashMap" literally.) Understand not just how to implement, but why you choose a collision strategy and resizing approach.

  2. 02

    Insert Operators to Evaluate Expression

    Data Structures & Algorithms

    Given an expression, insert + and * operators to evaluate to a target. Follow-ups included handling 0 (leading zeros) and handling negative numbers.

  3. 03

    Employee Presence Counter at Specific Times

    Data Structures & Algorithms

    Given employee names with entry and exit times, for specific times, find how many employees are present.

  4. 04

    Implement User Counter with Concurrency

    Data Structures & Algorithms

    How would you implement a counter for a given userId? (uId, counter) map. Follow-ups included handling in a multi-threaded environment.

How they prepared

I prepared for approximately 4 months.

Key Takeaways

  • Master fundamentals like HashMap internals, DFS/backtracking, interval/line-sweep techniques.
  • Always explain time and space complexity clearly and confidently.
  • Be fast at clarifying problem statements to avoid losing time.
  • Practice multi-threading patterns in your chosen language, including specifics like ConcurrentHashMap and AtomicInteger.
  • Don’t just “make it work” — be able to explain why your approach is correct and optimal.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!