Google | L4-Reject, L3-Offer | Bangalore | March 2022

Anonymous User

11661

Recruiter reached out over linkedin. And there was no online assessment. 2 DSA rounds were scheduled.

Round 1 (DSA)

2 questions were asked in this round. Leetcode medium level. After coding, very deep discussion around the time complexities

Similar to https://leetcode.com/problems/koko-eating-bananas/
Other one relating to complicated traversals in tree, similar to https://leetcode.com/problems/operations-on-tree
(Verdict: Strong Hire)

Round 2 (DSA)

1 question was asked in this round. Similar to https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another.
I took sometime to come up with most optimal solution, though it wasnt the most tough question. In the end I explained it, but couldnt code it in time.
(Verdict: Normal Hire/Lean hire at worst)

Heard the feedback as good to go for next rounds. In 1 week.
Round 3,4 were scheduled.

Round 3 (DSA)

1 question on a complicated tree traversal and mirroring it, and again follow up on it. Solved it in best time complexity. Finished the round before time
(Verdict: Strong Hire)

Round 4 (Googlyness)

Typical Hiring Manager kind of round, previous experiences based.
To check google cultural fit.
(Verdict: Strong Hire)

Verdict heard in 1 week.
After this it was submitted to hiring committee, after submitting a lot of questionaire, and even submitting an internal reference.
Meanwhile I also had a team matching call, which both myself and Manager liked each other. It was a new networking team being set from scratch in BLR.

HC results came in 1 week.
I was said, its provisionally approved for L3. For L4 I have to undergo 2 more DSA rounds, and get Strong Hire in both. Or I could just accept L3 offer. I asked for extra rounds.

Round 5 (DSA)

Was asked a very difficult question. LC Hard level. A customized variant of this: https://en.wikipedia.org/wiki/Longest_uncrossed_knight%27s_path. Apparently this was asked in previous years ICPC finals.
Bombed this round badly. Ask was to do in polynomial time complexity. I could only think of recursive, which would be exponential. Though I had certain observations, but nothing complete to code a working solution
(Verdict: No Hire)

After this declined the round 6, as round 5 eliminator I was already out. Didnt make sense to pursue further.
But recruiter reached out to me again, and encouraged to take up 2 more rounds. If i do well (strong-hire), can be through.

Round 6 (DSA)

Again a LC hard level question. We are given rules in the form of

For example:

P1 is in North of P2
P2 is in North of P3
P3 is in North of P1

Output: False (since P3 will be in South of P1)

Directions can be N,S,W,E,NW,NE,SW, etc.

I was able to solve it, but sadly needed a hint from interviewer. So feedback wasnt strong hire here. Though I completed the code in time, and interviewer was convinced.

Verdict (Lean hire/ Hire)

Round 7 (DSA)

1 LC medium, 1 LC hard.
https://leetcode.com/problems/word-break/
https://leetcode.com/problems/word-break-ii/
I solved both of them optimally. And wrote prod level code. So expecting strong hire.
Verdict (Strong hire)

As round 6 wasnt strong hire, again I was rejected for sde-2. I still could take sde-1, but didnt choose to.
Recruiter said i can again try in 3-6 months, as I feel prepared. Hope better luck next time :(

Also had 3 competing offers for SDE-2 level in other companies. Decided to go with them for now.

Google

2325 Questions·458 new·

7.6k·

Comments (6)