forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Adding JS Solutions For Problem No 219, 658 and 1343.
- Loading branch information
1 parent
96e744c
commit e876366
Showing
4 changed files
with
77 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,29 @@ | ||
| /** | ||
| * @param {number[]} nums | ||
| * @param {number} k | ||
| * @return {boolean} | ||
| */ | ||
| var containsNearbyDuplicate = function (nums, k) { | ||
| let leftPtr = 0; | ||
| let rightPtr = 0; | ||
| let windowHashMap = new Map(); | ||
| while (rightPtr < nums.length) { | ||
| if (windowHashMap.has(nums[rightPtr])) { | ||
| return true; | ||
| } else { | ||
| windowHashMap.set(nums[rightPtr], 1); | ||
| } | ||
| rightPtr++; | ||
| if (rightPtr - leftPtr > k) { | ||
| let leftPtrValue = windowHashMap.get(nums[leftPtr]); | ||
| leftPtrValue--; | ||
| if (leftPtrValue == 0) { | ||
| windowHashMap.delete(nums[leftPtr]); | ||
| } else { | ||
| windowHashMap.set(nums[leftPtr], leftPtrValue); | ||
| } | ||
| leftPtr++; | ||
| } | ||
| } | ||
| return false; | ||
| }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,22 @@ | ||
| /** | ||
| * @param {number[]} arr | ||
| * @param {number} k | ||
| * @param {number} x | ||
| * @return {number[]} | ||
| */ | ||
| var findClosestElements = function (arr, k, x) { | ||
| let [leftPtr, rightPtr] = [0, arr.length - k]; | ||
| while (leftPtr < rightPtr) { | ||
| /* This is basically rightPtr+leftPtr/2 written differently to | ||
| avoid any overflow incase it happens. | ||
| */ | ||
| let mid = parseInt(rightPtr + (leftPtr - rightPtr) / 2); | ||
|
|
||
| if (x - arr[mid] > arr[mid + k] - x) { | ||
| leftPtr = mid + 1; | ||
| } else { | ||
| rightPtr = mid; | ||
| } | ||
| } | ||
| return arr.slice(leftPtr, leftPtr + k); | ||
| }; |
23 changes: 23 additions & 0 deletions
23
...ipt/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.js
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,23 @@ | ||
| /** | ||
| * @param {number[]} arr | ||
| * @param {number} k | ||
| * @param {number} threshold | ||
| * @return {number} | ||
| */ | ||
| var numOfSubarrays = function (arr, k, threshold) { | ||
| let [leftPtr, rightPtr, result, windowSum] = [0, 0, 0, 0]; | ||
| while (rightPtr < arr.length) { | ||
| windowSum += arr[rightPtr]; | ||
| if (rightPtr - leftPtr >= k - 1) { | ||
| if (rightPtr - leftPtr > k - 1) { | ||
| windowSum -= arr[leftPtr]; | ||
| leftPtr++; | ||
| } | ||
| if (windowSum / k >= threshold) { | ||
| result++; | ||
| } | ||
| } | ||
| rightPtr++; | ||
| } | ||
| return result; | ||
| }; |