← Google questions

Mutual Friend in a Graph

Filed under Google

Given a graph of people (nodes) and friendships (edges), find the person who is not the target node but shares the maximum number of mutual friends with the target node.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.