Add solution #1090

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,129 LeetCode solutions in JavaScript
+# 1,130 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -870,6 +870,7 @@
 1080|[Insufficient Nodes in Root to Leaf Paths](./solutions/1080-insufficient-nodes-in-root-to-leaf-paths.js)|Medium|
 1081|[Smallest Subsequence of Distinct Characters](./solutions/1081-smallest-subsequence-of-distinct-characters.js)|Medium|
 1089|[Duplicate Zeros](./solutions/1089-duplicate-zeros.js)|Easy|
+1090|[Largest Values From Labels](./solutions/1090-largest-values-from-labels.js)|Medium|
 1092|[Shortest Common Supersequence](./solutions/1092-shortest-common-supersequence.js)|Hard|
 1103|[Distribute Candies to People](./solutions/1103-distribute-candies-to-people.js)|Easy|
 1108|[Defanging an IP Address](./solutions/1108-defanging-an-ip-address.js)|Easy|

solutions/1090-largest-values-from-labels.js

@@ -0,0 +1,41 @@
+/**
+ * 1090. Largest Values From Labels
+ * https://leetcode.com/problems/largest-values-from-labels/
+ * Difficulty: Medium
+ *
+ * You are given n item's value and label as two integer arrays values and labels. You are also
+ * given two integers numWanted and useLimit.
+ *
+ * Your task is to find a subset of items with the maximum sum of their values such that:
+ * - The number of items is at most numWanted.
+ * - The number of items with the same label is at most useLimit.
+ *
+ * Return the maximum sum.
+ */
+
+/**
+ * @param {number[]} values
+ * @param {number[]} labels
+ * @param {number} numWanted
+ * @param {number} useLimit
+ * @return {number}
+ */
+var largestValsFromLabels = function(values, labels, numWanted, useLimit) {
+  const items = values.map((value, index) => ({ value, label: labels[index] }));
+  items.sort((a, b) => b.value - a.value);
+
+  const labelCount = new Map();
+  let result = 0;
+  let itemsUsed = 0;
+
+  for (const { value, label } of items) {
+    const currentCount = labelCount.get(label) || 0;
+    if (itemsUsed < numWanted && currentCount < useLimit) {
+      result += value;
+      labelCount.set(label, currentCount + 1);
+      itemsUsed++;
+    }
+  }
+
+  return result;
+};