Google India phone screen round (L3)
Summary
I had a phone screen round with Google India for an L3 role where I was asked a hard graph problem. My proposed solution's time complexity was not entirely satisfactory to the interviewer, leading to uncertainty about progressing to further rounds.
Full Experience
I was asked the question https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/description/ in google phone screening round. I have given the solution with time complexity O(V^4log(V)) and the interviewer is not completely satisifed as it can be done in O(E(log(v))). Any chances of getting shortlisted for the further rounds
Interview Questions (1)
The problem discussed was 'Minimum Weighted Subgraph With the Required Paths', linked at https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/description/.