I had my Google phone screen round at the end of march. I was asked similar question to this https://leetcode.com/problems/minimum-weighted-subgraph-with-the-required-paths/description/ 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.