Google L3 TPS(March)

Posted
7 Apr 2025
347 reads

Summary

I had my Google phone screen at the end of March for an L3 position, where I was presented with a graph problem similar to LeetCode's Minimum Weighted Subgraph, adapted for an undirected and unweighted graph, along with a follow-up about multiple friends reaching a destination.

How it went

I had my Google phone screen round at the end of march. I was asked similar question to this Minimum Weighted Subgraph with the Required Paths but the graph in the question given to me was undirected and unweighted graph. Follow-up: What if there are 3 friends trying to reach the 4th friend? Was able to come up with the optimal solution for the initial question but did not had enough time for the follow-up.

Questions asked (2)

  1. 01

    Minimum Paths in Undirected Unweighted Graph

    Data Structures & Algorithms

    I was asked a question similar to this LeetCode problem: Minimum Weighted Subgraph with the Required Paths. However, the graph in the question given to me was undirected and unweighted.

    Open the problem
  2. 02

    Multiple Friends Reaching a Destination

    Data Structures & Algorithms

    Follow-up: What if there are 3 friends trying to reach the 4th friend?

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!