Spring Hire Sale
Limited Time Deal: Unlock all premium questions for over 30% off
$10.42$7.08
08
:
04
:
55
:
45
Back to Dashboard
Non-Adjacent Team Selection
Hard
Question
You are given n people labeled from 0 to n - 1. Some pairs of people know each other directly. These relationships are given as a list connections, where each element [a, b] means person a and person b know each other.
...