Given an array of strings req_skills containing required skills, and an array of lists of strings people where people[i] contains the skills possessed by the $i^{th}$ individual.

A team is considered sufficient if every skill in req_skills is possessed by at least one member of the team.

Return the indices of the members in a sufficient team of the smallest possible size. You may return the indices in any order.

Constraints:

• $1 \leq \text{req\_skills.length} \leq 16$

• $1 \leq \text{req\_skills[i].length} \leq 16$

• req_skills[i] consists of lowercase English letters.

• All the strings of req_skills are unique.

• $1 \leq \text{people.length} \leq 60$

• $0 \leq \text{people[i].length} \leq 16$

• $1 \leq \text{people[i][j].length} \leq 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.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.