# Smallest Sufficient Team: Walkthrough

Smallest Sufficient Team shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Bitmask DP over the required-skill set: dp[mask] is the smallest list of people that cover that skill mask. For each person, try dp[mask | personMask] = better of itself and dp[mask] plus that person.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n * 2^m) where m is the number of skills.

## Common mistake

A greedy "pick whoever adds the most new skills" pass, which can miss a smaller covering team.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at learn more.