Practice Two Sigma Coding Question | Real Coding Interviews

Quick Summary

Identify the maximum number of people that can be grouped together such that no two members know each other directly.
The input relationships form a connected tree structure with exactly n-1 edges and no cycles.
Requires making locally optimal inclusion or exclusion decisions for each person based on their immediate neighbors.

What This Tests

Tree dynamic programming
Graph traversal and state management
Recursive decomposition of subproblems
Iterative implementation to prevent stack overflow on deep trees

Common Patterns

Dynamic Programming

Graph Traversal

DFS/BFS

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.

The relationships satisfy the following conditions:

Test Cases

Input

Output

Expected