Add solution #2099

Author: JoshCrozier

README.md

@@ -272,6 +272,7 @@
 2053|[Kth Distinct String in an Array](./2053-kth-distinct-string-in-an-array.js)|Medium|
 2085|[Count Common Words With One Occurrence](./2085-count-common-words-with-one-occurrence.js)|Easy|
 2095|[Delete the Middle Node of a Linked List](./2095-delete-the-middle-node-of-a-linked-list.js)|Medium|
+2099|[Find Subsequence of Length K With the Largest Sum](./2099-find-subsequence-of-length-k-with-the-largest-sum.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 
 ## License

solutions/2099-find-subsequence-of-length-k-with-the-largest-sum.js

@@ -0,0 +1,36 @@
+/**
+ * 2099. Find Subsequence of Length K With the Largest Sum
+ * https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/
+ * Difficulty: Medium
+ *
+ * You are given an integer array nums and an integer k. You want to find a subsequence
+ * of nums of length k that has the largest sum.
+ *
+ * Return any such subsequence as an integer array of length k.
+ *
+ * A subsequence is an array that can be derived from another array by deleting some or
+ * no elements without changing the order of the remaining elements.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var maxSubsequence = function(nums, k) {
+  const map = new Map();
+  nums.slice()
+      .sort((a, b) => a - b)
+      .slice(-k)
+      .forEach(n => map.set(n, (map.get(n) || 0) + 1));
+
+  return nums.filter(n => {
+    const isInSubsequence = map.get(n);
+
+    if (isInSubsequence) {
+      map.set(n, map.get(n) - 1);
+    }
+
+    return isInSubsequence;
+  });
+};