Merge pull request neetcode-gh#2439 from tayyabferozi/main

Author: aakhtar3

javascript/0347-top-k-frequent-elements.js

@@ -1,5 +1,5 @@
 /**
- * Set - Frequency Counter
+ * Set - Frequency Counter | Using sort
  * Time O(NlogN) | Space O(N)
  * https://leetcode.com/problems/top-k-frequent-elements/
  * @param {number[]} nums
@@ -22,3 +22,44 @@ var topKFrequent = function(nums, k) {
     }
     return output;
 };
+
+/**
+ * Without Sort
+ * Time O(N) | Space O(k)
+ * https://leetcode.com/problems/top-k-frequent-elements/
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+
+var topKFrequent = function(nums, k) {
+    const mp = new Map();
+    const arr = new Array(nums.length + 1).fill(0);
+    const ans = [];
+
+    nums.forEach(el => {
+        const val = mp.get(el) || 0;
+        mp.set(el, val + 1);
+    });
+
+    for ( let [key, value] of mp ) {
+        const prev = arr[value] || [];
+        prev.push(key);
+        arr[value] = prev;
+    }
+
+
+    arr.reverse();
+    for (let el of arr) {
+        if (k < 1) break;
+        if (el) {
+            for (let el2 of el) {
+                if (k < 1) break;
+                ans.push(el2);
+                k--;
+            }
+        }
+    }
+
+    return ans;
+};

javascript/0424-longest-repeating-character-replacement.js

@@ -1,3 +1,30 @@
+/**
+ * https://leetcode.com/problems/longest-repeating-character-replacement/
+ * Time O(((N + 26) * N) * (M - N)) | Space O(1)
+ * @param {string} s
+ * @param {number} k
+ * @return {number}
+ */
+var characterReplacement = function(s, k) {
+    let res = 0;
+    let count = new Map();
+    let l = 0;
+
+    for (let r = 0; r < s.length; r++) {
+        let len  = r - l + 1
+        count.set(s[r], 1 + (count.get(s[r]) || 0))
+
+        if ((len - Math.max(...count.values())) > k) {
+            count.set(s[l], count.get(s[l]) - 1)
+            l++;
+        }
+        len = r - l + 1;
+        res = Math.max(res, len)
+    }
+
+    return res;
+};
+
 /**
  * https://leetcode.com/problems/longest-repeating-character-replacement/
  * Time O(((N + 26) * N) * (M - N)) | Space O(1)