Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Beautiful Arrangement
Coding · Array · Backtracking · Bit Manipulation
- Number of Ways to Wear Different Hats to Each Other
Coding · Array · Bipartite Graph · Bit Manipulation
- Optimal Account Balancing
Coding · Array · Backtracking · Bit Manipulation
- Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1125. Smallest Sufficient Team
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Airbnb
Smallest Sufficient Team
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 81.8. This is not an interview probability.
View source