Leetcode Problem 1125. Smallest Sufficient Team

1125. Smallest Sufficient Team

Leetcode Solutions

Map each skill to a unique index and represent the set of skills as a bitmask.
Initialize a DP array dp where dp[mask] represents the smallest team that can cover the skills represented by mask.
Set dp[0] to 0, representing an empty team for no skills.
For each skillsMask from 1 to 2^m - 1, iterate over all people.
For each person, calculate smallerSkillsMask by removing the person's skills from skillsMask.
Update dp[skillsMask] with the smaller of the current value or the union of dp[smallerSkillsMask] and the current person.
After filling the DP array, reconstruct the team from dp[2^m - 1].

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen