google logo
Google· SDE II

Google L4 Complete Experience

Experience
3.9 years
Posted
25 Apr 2025
430 reads

Summary

I interviewed for an L4 position at Google, completing a phone screen and four onsite rounds. Despite providing solutions for most technical questions, I don't believe I will be moving forward this time, possibly due to ghosting or ongoing hiring freezes.

How it went

YOE - 3.9 years Position - L4

TPS:

This happened around february , I dont remember the question exactly but it was a simple binary question where elements might be equal and we have to return the last occurence

Verdict : Passed

I got the reponse immediately but no further communication for a month , I contacted canditate support and they replied back after 2 weeks with a new recruiter and recruiter changed twice after that every week and finally had my onsite scheduled.

Onsite 1: https://leetcode.com/discuss/post/6676870/google-l4-onsite-1-by-anonymous_user-ehu5/ LC similar - https://leetcode.com/problems/last-day-where-you-can-still-cross/

Verdict (My opinion) - (LH/LNH) I couldnt code the Union Find(O(m*n)) approach completely and only code the BFS/DFS approach (O(m^2n^2)), question was straight forward but I got a bit confused.

Onsite 2: (This got rescheduled for the next day) Question was already mentioned in previous LC posts Given an expression with '+','-', small case letters and parenthesis , simplify it

a-(b-c) -> a-b+c a+(a-(b+c)) ->2a-b-c

Follow up -> What if instead of just small case letters, it could have integers as well

Verdict (My opinion) - (NH/LNH) I gave the solution with pushing signs into stack and finding the sign from current top , took me a bit of time , but answered followup as well

Onsite 3:

This question : https://leetcode.com/problems/time-taken-to-cross-the-door/description/

Verdict (My opinion) - (H/LH) Gave the priority_queue solution with O(nlogn) , interviewer asked for O(n) gave that as well as the times are already sorted just split the arrays and process with two pointers , he said no extra space , gave that solution too , he asked me to code any one of the O(n) solutions , coded the first one with extra space , He said in the beginning he might have a followup but didnt ask due to time ,thats why I dont think it will be Hire.

Onsite 4:

Googlyness , just some behaviourial questions like explaning a project I worked on end to end , any conflicts i faced and such. It went well. Not sure what the rating would be for this.

Conclusion:

Overall I dont think I will be moving forward this time , but for any others preparing for the same , focus on recently asked questions and if possible take the premium and try to do the medium/hard questions for last 3 months , all the questions I got were covered in these two. I will update with actual ratings when I get the call from the recruiter if I do :')

Edit(10 days post last onsite) :

I have gotten no call , no reply from the recruiter , looks like I might have been ghosted or related to the ongoing firing and hiring freeze. Will update if the recruiter reaches out.

Questions asked (4)

  1. 01

    Find Last Occurrence in Binary Search (with duplicates)

    Data Structures & Algorithms

    A simple binary search question where elements might be equal, and the goal is to return the last occurrence of the target element.

  2. 02

    Last Day Where You Can Still Cross

    Data Structures & Algorithms

    LeetCode problem similar to 'Last Day Where You Can Still Cross'.

    Open the problem
  3. 03

    Simplify Expression with Parentheses and Letters

    Data Structures & Algorithms

    Given an expression with '+', '-', small case letters, and parentheses, simplify it. Examples: a-(b-c) -> a-b+c, a+(a-(b+c)) ->2a-b-c. Follow up: What if instead of just small case letters, it could have integers as well?

  4. 04

    Time Taken to Cross the Door

    Data Structures & Algorithms

    LeetCode problem: Time Taken to Cross the Door.

    Open the problem

How they prepared

Overall I don't think I will be moving forward this time, but for any others preparing for the same, focus on recently asked questions and if possible take the premium and try to do the medium/hard questions for last 3 months, all the questions I got were covered in these two.

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!