LeetCode [1125] Smallest Sufficient Team

 1125. Smallest Sufficient Team

Hard

In a project, you have a list of required skills req_skills, and a list of people.  The i-th person people[i] contains a list of skills that 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: for example, team = [0, 1, 3] represents the people with skills people[0], people[1], and people[3].

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.

 

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 <= people.length <= 60
• 1 <= people[i].length, req_skills[i].length, people[i][j].length <= 16
• Elements of req_skills and people[i] are (respectively) distinct.
• req_skills[i][j], people[i][j][k] are lowercase English letters.
• Every skill in people[i] is a skill in req_skills.
• It is guaranteed a sufficient team exists.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

class Solution { public int[] smallestSufficientTeam(String[] req_skills, List<List<String>> people) { Map<String, Integer> skill2Index = new HashMap<>(); for(int i=0; i<req_skills.length; ++i) skill2Index.put(req_skills[i], i); int allSkills = (1<<req_skills.length)-1; Set<Integer>[] skills2Team = new HashSet[allSkills+1]; skills2Team[0] = new HashSet<>(); for(int p=0; p<people.size(); ++p){ int ps = 0;//bitmask of people[p]'s skills for(String skill : people.get(p)) ps |= (1<<skill2Index.get(skill)); for(int i=0; i<skills2Team.length; ++i){ int curSkills = i; Set<Integer> curTeam = skills2Team[i]; if(curTeam==null) continue; int combinedSkill = curSkills | ps; if(combinedSkill == curSkills) continue;//people[p] does not bring in new skills if(skills2Team[combinedSkill]==null || skills2Team[combinedSkill].size()>curTeam.size()+1){ Set<Integer> newTeam = new HashSet<>(curTeam); newTeam.add(p); skills2Team[combinedSkill] = newTeam; } } } return skills2Team[allSkills].stream().mapToInt(i->i).toArray(); } }