Add solution #1125

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,142 LeetCode solutions in JavaScript
+# 1,143 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -888,6 +888,7 @@
 1122|[Relative Sort Array](./solutions/1122-relative-sort-array.js)|Easy|
 1123|[Lowest Common Ancestor of Deepest Leaves](./solutions/1123-lowest-common-ancestor-of-deepest-leaves.js)|Medium|
 1124|[Longest Well-Performing Interval](./solutions/1124-longest-well-performing-interval.js)|Medium|
+1125|[Smallest Sufficient Team](./solutions/1125-smallest-sufficient-team.js)|Hard|
 1137|[N-th Tribonacci Number](./solutions/1137-n-th-tribonacci-number.js)|Easy|
 1143|[Longest Common Subsequence](./solutions/1143-longest-common-subsequence.js)|Medium|
 1161|[Maximum Level Sum of a Binary Tree](./solutions/1161-maximum-level-sum-of-a-binary-tree.js)|Medium|

solutions/1125-smallest-sufficient-team.js

@@ -0,0 +1,47 @@
+/**
+ * 1125. Smallest Sufficient Team
+ * https://leetcode.com/problems/smallest-sufficient-team/
+ * Difficulty: Hard
+ *
+ * In a project, you have a list of required skills reqSkills, 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 reqSkills,
+ * 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.
+ */
+
+/**
+ * @param {string[]} reqSkills
+ * @param {string[][]} people
+ * @return {number[]}
+ */
+var smallestSufficientTeam = function(reqSkills, people) {
+  const skillCount = reqSkills.length;
+  const skillMap = new Map(reqSkills.map((skill, index) => [skill, 1 << index]));
+  const peopleSkills = people.map(skills =>
+    skills.reduce((mask, skill) => mask | skillMap.get(skill), 0)
+  );
+  const target = (1 << skillCount) - 1;
+  const dp = new Map([[0, []]]);
+
+  for (let i = 0; i < people.length; i++) {
+    const currentSkill = peopleSkills[i];
+    for (const [prevMask, team] of dp) {
+      const newMask = prevMask | currentSkill;
+      if (!dp.has(newMask) || dp.get(newMask).length > team.length + 1) {
+        dp.set(newMask, [...team, i]);
+      }
+    }
+  }
+
+  return dp.get(target);
+};