google logo
Google· SDE I

Google L3 | Interview Experience

Posted
16 May 2025
402 reads

Summary

I completed my onsite interview for an L3 role at Google and am sharing the questions, though I am unsure about the outcome and believe I may need to look for other opportunities.

How it went

I have completed my Onsite Interview, I dont know what will be the result but lets share the questions with the community.

Round 1: Backtracking - Number of ways to generate pattern passwords in a phone. Went pretty good.

Round 2: Queue: Minimum end time for all the tasks given that each will take fixed amount to get executed and given fixed number of CPUs. Follow up was to find the minimum CPUs, I gave a NLogN approach but they wanted linear, times up. Everything was good except follow up complexity

Round 3: Googlyness: very good discussions.

Round 4: From all the subarrays, return the kth smallest subarray sum . Array can be having negative numbers too. Only was able to provide brute force approach.

I think its time to look for other opportunities :(

Questions asked (3)

  1. 01

    Generate Pattern Passwords on Phone

    Data Structures & Algorithms

    Number of ways to generate pattern passwords on a phone.

  2. 02

    Minimum End Time for Tasks with Fixed CPUs

    Data Structures & Algorithms

    Minimum end time for all the tasks given that each will take fixed amount to get executed and given fixed number of CPUs. Follow up was to find the minimum CPUs.

  3. 03

    Kth Smallest Subarray Sum

    Data Structures & Algorithms

    From all the subarrays, return the kth smallest subarray sum. The array can have negative numbers too.

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!