Leetcode 1125. Smallest Sufficient Team

Given up to 16 required skills and up to 60 people each with some skills, find the smallest set of people whose combined skills cover all required skills. Core challenge: treat skill sets as bitmasks and search/DP over skill subsets to compute a minimum-cardinality cover.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1125. Smallest Sufficient Team

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact