Google | L4 | Interview Experience | Chances
Summary
I completed four technical rounds for an L4 position at Google, covering virtual and onsite data‑structure problems.
Full Experience
Hi Guys,
i have completed my L4 technical rounds
-
DS - Virtual - kind of BST with longest path having same node value and minor follow up dfs (this i have explained and coded)
-
Googliness - Virtual - Standard questions
-
DS - onsite - scheduling tasks cpu's, follow up number of cpu's needed to have best time.
-
DS - Onsite - find max size of rectangle using the given points.
i feel
- H/SH,(H due to minor confusion of space complexity)
- SH/H
- H/LH - succesfully coded and explained and follow-up sol was agreed and started coding minor condition was written wrong, but interviewer got the idea since time got ended.
- H/SH - Only one question i have give n** 3 sol, then given optimal solution of n** 2 + k*c** 2, but expected give in n terms.
first/second-> first rating i have high confidence.
what were changes,any one have idea?
Interview Questions (3)
BST longest path with same node value
Given a binary search tree, find the longest path where all nodes share the same value. The candidate was also asked a follow‑up depth‑first search question related to this problem.
CPU scheduling and optimal CPU count
Given a set of tasks and a pool of CPUs, design a schedule for the tasks and determine the number of CPUs required to achieve the best overall execution time.
Maximum rectangle from given points
Given a collection of points on a 2‑D plane, find the maximum possible size (area) of a rectangle that can be formed using those points as vertices.