Google Phone Screen - L3, Verdict: Passed
Summary
I had a phone screen on 08/04 for an L3 position at Google and was asked a graph problem about finding a path between airports considering flight timings. I successfully cleared this round and am awaiting contact from a new recruiter for the next steps.
Full Experience
I had my phone screen on 08/04. I was asked a question from graphs.
We are given source and destination airports. And a list of flights, where each flight has four paramaters: from_airport, to_airport, departure_time, arrival_time. We need to return whether its possible to reach the destination from source using the given set of flights.
It is same as: https://leetcode.com/discuss/post/6352084/google-l4-phone-screening-round-by-anony-aa15/
I came up with below solutions:
- Bruteforce: Recursion to consider and not consider every flight - O(2^N)
- Simple traversal
- Dijkstra modification by using heap on the arrival time of the flights
I coded the last one using heap, I might have missed few corner cases though.
I heard back from recruiter on 11/04 that I cleared phone screen and my candidature would be taken forward by another recruiter. Its been a week since I got this mail but haven't heard from the new recruiter.
I am happy that I am getting time to prepare but also don't want to lose this opportunity.
Should I mail them asking about next steps? or is it okay if I wait for a week more?