Merge pull request neetcode-gh#1840 from andynullwong/1838

Create 1838-frequency-of-the-most-frequent-element.js & .ts

Author: tahsintunan

javascript/1838-frequency-of-the-most-frequent-element.js

@@ -0,0 +1,27 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var maxFrequency = function (nums, k) {
+    const sortedNums = nums.sort((a, b) => a - b);
+
+    let maxLength = 0;
+
+    let currentSum = 0;
+    let leftWindow = 0;
+    for (let rightWindow = 0; rightWindow < sortedNums.length; rightWindow++) {
+        const currentLength = rightWindow - leftWindow + 1;
+        const rightNum = sortedNums[rightWindow];
+        currentSum += rightNum;
+
+        if (currentSum + k >= rightNum * currentLength) {
+            maxLength = currentLength;
+        } else {
+            const leftNum = sortedNums[leftWindow];
+            currentSum -= leftNum;
+            leftWindow++;
+        }
+    }
+    return maxLength;
+};

typescript/1838-frequency-of-the-most-frequent-element.ts

@@ -0,0 +1,22 @@
+function maxFrequency(nums: number[], k: number): number {
+    const sortedNums: number[] = nums.sort((a: number, b: number) => a - b);
+
+    let maxLength: number = 0;
+
+    let currentSum: number = 0;
+    let leftWindow: number = 0;
+    for (let rightWindow: number = 0; rightWindow < sortedNums.length; rightWindow++) {
+        const currentLength: number = rightWindow - leftWindow + 1;
+        const rightNum: number = sortedNums[rightWindow];
+        currentSum += rightNum;
+
+        if (currentSum + k >= rightNum * currentLength) {
+            maxLength = currentLength;
+        } else {
+            const leftNum = sortedNums[leftWindow];
+            currentSum -= leftNum;
+            leftWindow++;
+        }
+    }
+    return maxLength;
+};