google logo
Google· SDE I

Google India phone screen round (L3)

Location
India
Posted
4 Apr 2025
388 reads

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.

How it went

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

Questions asked (1)

  1. 01

    Minimum Weighted Subgraph With the Required Paths

    Data Structures & Algorithms

    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/.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!