Practice Smallest Sufficient Team

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#1125

LeetCode Problem

Smallest Sufficient Team

Array Dynamic Programming Bit Manipulation Bitmask

Problem Statement

In a project, you have a list of required skills req_skills, and a list of people. The ith person people[i] contains a list of skills that the person has. Consider a sufficient team: a set of people such that for every required skill in req_skills, there is at least one person in the team who has that skill. We can represent these teams by the index of each person. Return any sufficient team of the smallest possible size, represented by the index of each person. You may return the answer in any order. It is guaranteed an answer exists.

Source: Smallest Sufficient Team on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

req_skills = ["java","nodejs","reactjs"], people = [["java"],["nodejs"],["nodejs","reactjs"]]

Output

[0,2]

# Example 2

Input

req_skills = ["algorithms","math","java","reactjs","csharp","aws"], people = [["algorithms","math","java"],["algorithms","math","reactjs"],["java","csharp","aws"],["reactjs","csharp"],["csharp","math"],["aws","java"]]

Output

[1,2]

Constraints

1 <= req_skills.length <= 16

1 <= req_skills[i].length <= 16

req_skills[i] consists of lowercase English letters.

All the strings of req_skills are unique.

1 <= people.length <= 60

0 <= people[i].length <= 16

1 <= people[i][j].length <= 16

people[i][j] consists of lowercase English letters.

All the strings of people[i] are unique.

Every skill in people[i] is a skill in req_skills.

It is guaranteed a sufficient team exists.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free