Two SigmaCoding·60 minMembers
Maximum Independent Set on a Tree
Members only
Given a social graph that is guaranteed to be a tree, select the largest possible group of people such that no two selected people know each other. Follow-up: remove the tree guarantee.
SWE
tree
dp
graph
hard
Frequency
Single report
Last asked
2025-11-18
Stage
onsite-coding
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
