Google L3 Interview Experience
Summary
I experienced a Google L3 interview which included a technical phone screen and a 4-round onsite. Despite some challenges and self-perceived difficulties, I provided my self-verdicts for each round and anticipate mixed feedback.
Full Experience
Interview Rounds:
Technical Phone Screen (In december first-second week): Question 1: One question was based on using some random number everytime and find and remove element on that index. Question 2: Given a list of n elements in array, in one operation you need to delete that element and twice of that element, tell min moves required to make array empty.
Self Verdit: Hire/Strong Hire (Don't think this interview feedback get considered or not)
Onsite (3 Rounds) (Recently): Round 1: Given a 2D matrix contains values 0 and 1, where grid[i][j] represent probability to win for i player against player j. You have given order of games in which it gets played tell winner of tournament.
Initially framed as a normal problem, but the follow up was that grid values can be in decimal between (0 and 1), then tell the winner just the approach. Got Stuck in follow up took hints and interview went on 10 mins more then 45 minutes.
Self Verdict: Hire/Lean Hire
Round 2: Topological sort question Did code quickly and was asked a follow up on it tell that also.
Self Verdict: Hire/Strong Hire
Round 3: Graph Based Problem Was given array in which two friends and time when they will become friends, and was also given two friends F1 & F2, need to tell minimum time when they will become friends. Solved using graph and dp array to store min time for 2 friends when they became friends, but messed a bit in that interview while writing code dont know why.
Self Verdict: Hire/Lean Hire
Round 4: Googlyness Round Was asked questions on work exp and standard behavioural questions.
Self Verdict: Hire
Think it will be a mixed feedback from interviewers so chances are very less.
Hope it helps.
Interview Questions (4)
Given a list of n elements in array, in one operation you need to delete that element and twice of that element, tell min moves required to make array empty.
Given a 2D matrix contains values 0 and 1, where grid[i][j] represent probability to win for i player against player j. You have given order of games in which it gets played tell winner of tournament. Initially framed as a normal problem, but the follow up was that grid values can be in decimal between (0 and 1), then tell the winner just the approach. Got Stuck in follow up took hints and interview went on 10 mins more then 45 minutes.
Graph Based Problem Was given array in which two friends and time when they will become friends, and was also given two friends F1 & F2, need to tell minimum time when they will become friends.
Was asked questions on work exp and standard behavioural questions.