Smallest Sufficient Team | Dataford Interview Questions

Smallest Sufficient Team (LeetCode 1125)

Asked in the Coding stage. Given a list of required skills and each person's skills, return indices of the smallest team covering every required skill.

Input: req_skills, a list of unique strings, and people, a list of skill lists. Output a list of person indices. Any smallest team is valid.

Example: req_skills = ["a", "b"], people = [["a"], ["b"], ["a", "b"]] returns [2].

Constraints: at most 16 required skills, at most 60 people, and at least one sufficient team exists.

Constraints

1 <= len(req_skills) <= 16
1 <= len(people) <= 60
Each required skill is unique
Each person's skills are drawn from req_skills
At least one sufficient team exists
Any smallest sufficient team is accepted

Function Signature

def smallest_sufficient_team(req_skills, people):

Your question is Smallest Sufficient Team. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem