โ† Microsoft questions

Find minimum disjoint friend groups

Filed under Microsoft

Given an undirected graph where nodes represent people and edges represent friendships, find the number of connected components, which correspond to the minimum disjoint friend groups.

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 Microsoft questions

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