Google | L4 | Interview Experience
Summary
I interviewed for an L4 position at Google, completing two preliminary screening rounds and four onsite rounds covering DSA and Googlyness, ultimately receiving an offer after two team matching calls.
Full Experience
YOE - 3.9 years
Position - L4
TPS - 1: Last week of Feb
I dont remember the question exactly but it was a tricy greedy plus math problem. I completed the solution got 3-4 follow ups able to complete all the requirements within timeline.
Verdict : Mixed review as some code quality were not upto the mark. So another TPS got scheduled.
TPS - 2: 2nd week of March
This happened last week of february , the problem was of sliding window but it was a bit tricy and solved in optimal approach along with the few follow ups.
Verdict : Positive.
Onsite Rounds - 3 DSA + 1 Googlyness onsites scheduled in a single week (1st week of April)
Onsite - 1: 1st week of April
Problem -> Very much similar to -> how many person visible to a single guy. Tackled this with monotonic stack and it was an optimal solution. With all the edge cases covered. (Basically first they start with a basic problem and then the follow ups make the problem hard)
Verdict : Positive. (H/SH I think)
Onsite - 2: 1st week of April
Problem -> String matching and autocomplete system. Explained multiple approaches and went ahead with the trie approach and completed the solution. There was a bit difference of space complexity which I mentioned earlier and the one after optimising the time complexity, still I mentioned this and explained.
Verdict : Space complexity part was mentioned like it was not the same which I wrote in the starting. But got positive feedback as everything was fine from my side. (Hire I think)
Onsite - 3: 1st week of April
Problem 1 -> A binary search + math problem where need to search the size of the universe to fit all the galaxies.
Problem 2 -> There is a piano player and can play piano with one hand and the thumb position is given, and series of notes given to play what will be the minimum number of times player needs to move his hand to play all the notes. --> A simple 2DP approach for this works and that was optimal too.
Able to solve both the problem in optimal way with dry run within the timelines.
Verdict : Positive. (H/SH I think)
Onsite 4 -> Googlyness : 2nd week of April
This round started with intro and 6-7 scenario based problems. Followed STAR methodology and covered almost all the scenarios in best way I can do.
Verdict: Mixed review not SH I would say but yeah I think it is Hire.
Team Matching - 1: last week of April
Had a team fit call in last week of April, the team doesn't fully align what I have worked on till now as it is a IAAS but the round went well and discussion were also good.
Verdict : On Hold.
Team Matching - 2: 2nd week of May
Mostly discussion on my past work and team work alignment with some behavioural questions.
Verdict : Selected.
Final Verdict: Offer : 3rd week of May
Compensation: https://leetcode.com/discuss/post/6769504/google-l4-compensation-hyd-by-anonymous_-3azp/
Interview Questions (4)
A problem very similar to 'how many persons are visible to a single guy'. This problem typically starts with a basic version and gets harder with follow-ups.
Design and implement an autocomplete system involving string matching.
A binary search and math problem where the goal is to search for the size of the universe required to fit all given galaxies.
Given a piano player's thumb position and a series of notes to play, determine the minimum number of times the player needs to move their hand to play all notes. A simple 2D dynamic programming approach works optimally for this problem.