Google SDE 3 interview | phone screen experience | USA

Anonymous User
1797
Oct 14, 2026
Oct 19, 2026

There were 2 interviews.
The first one was behavioral, where I was asked questions on my resume to describe how I build the services and what were the tradeoffs for them.

The second interview was a coding interview.
Question : you are given a n nodes and edges which are transnmission lines which can have values from 0 to 1. Given a Source and destination return the path with maximum efficency.
For this solution I immediately jumped to dijkstra's algorithm and explained how I would solve this. But the interviewer asked what about DFS and BFS? I told for DFS how I would solve it but the time complexity would be O(V!). Hence I didnt propose it. Then He asked me about BFS solution. I was trying to explain an answer for BFS but wasn't able to find a solution, explained a couple of approaches and he pointed out those wont work and later he told me that solution is not possible with BFS. So I started coding the dijkstra's solution and time ran out. I wasn't able to run through an example for the code. I just explained the time and space complexity for this solution.
I also didnt ask for constraints and made any asumptions, like how many nodes or edges. Will there be a garantueed path always. I was not able to ask those questions and my interviewer pointed those things out.

Do you guys thing this is passing?

Update: I got a rejection email.

Comments (8)