Merge branch 'neetcode-gh:main' into main

Author: tahzeer

README.md

@@ -105,7 +105,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0018 - 4Sum](https://leetcode.com/problems/4sum/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0018-4sum.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0018-4Sum.go)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0018-4sum.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0018-4sum.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0018-4sum.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0018-4sum.ts)</div></sub>
 <sub>[0011 - Container With Most Water](https://leetcode.com/problems/container-with-most-water/)</sub> | <sub><div align='center'>[✔️](c%2F0011-container-with-most-water.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0011-container-with-most-water.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0011-container-with-most-water.cs)</div></sub> | <sub><div align='center'>[✔️](dart%2F0011-container-with-most-water.dart)</div></sub> | <sub><div align='center'>[✔️](go%2F0011-container-with-most-water.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0011-container-with-most-water.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0011-container-with-most-water.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0011-container-with-most-water.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0011-container-with-most-water.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0011-container-with-most-water.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0011-container-with-most-water.rs)</div></sub> | <sub><div align='center'>[✔️](scala%2F0011-container-with-most-water.scala)</div></sub> | <sub><div align='center'>[✔️](swift%2F0011-container-with-most-water.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0011-container-with-most-water.ts)</div></sub>
 <sub>[1498 - Number of Subsequences That Satisfy The Given Sum Condition](https://leetcode.com/problems/number-of-subsequences-that-satisfy-the-given-sum-condition/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F1498-number-of-subsequences-that-satisfy-the-given-sum-condition.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1498-number-of-subsequences-that-satisfy-the-given-sum-condition.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1498-number-of-subsequences-that-satisfy-the-given-sum-condition.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
-<sub>[0189 - Rotate Array](https://leetcode.com/problems/rotate-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0189-rotate-array.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0189-rotate-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0189-rotate-array.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0189-rotate-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0189-rotate-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0189-rotate-array.ts)</div></sub>
+<sub>[0189 - Rotate Array](https://leetcode.com/problems/rotate-array/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F0189-rotate-array.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0189-rotate-array.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0189-rotate-array.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0189-rotate-array.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0189-rotate-array.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0189-rotate-array.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0189-rotate-array.ts)</div></sub>
 <sub>[1968 - Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/)</sub> | <sub><div align='center'>[✔️](c%2F1968-array-with-elements-not-equal-to-average-of-neighbors.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F1968-array-with-elements-not-equal-to-average-of-neighbors.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1968-array-with-elements-not-equal-to-average-of-neighbors.kt)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0881 - Boats to Save People](https://leetcode.com/problems/boats-to-save-people/)</sub> | <sub><div align='center'>[✔️](c%2F0881-boats-to-save-people.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0881-boats-to-save-people.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](javascript%2F0881-boats-to-save-people.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0881-boats-to-save-people.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0881-boats-to-save-people.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0881-boats-to-save-people.ts)</div></sub>
 <sub>[0042 - Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)</sub> | <sub><div align='center'>[✔️](c%2F0042-trapping-rain-water.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0042-trapping-rain-water.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0042-trapping-rain-water.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0042-trapping-rain-water.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0042-trapping-rain-water.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0042-trapping-rain-water.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0042-trapping-rain-water.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0042-trapping-rain-water.py)</div></sub> | <sub><div align='center'>[✔️](ruby%2F0042-trapping-rain-water.rb)</div></sub> | <sub><div align='center'>[✔️](rust%2F0042-trapping-rain-water.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0042-trapping-rain-water.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0042-trapping-rain-water.ts)</div></sub>

javascript/0189-rotate-array.js

@@ -0,0 +1,26 @@
+/**
+ * Two Pointers
+ * https://leetcode.com/problems/rotate-array/
+ * 
+ * Time O(n) | Space O(1)
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+ var rotate = function(nums, k) {
+    
+    // if the k exceeds the length of nums.
+    k = k % nums.length;
+
+    nums.reverse();
+    reversePortionOfArray(nums, 0, k - 1);
+    reversePortionOfArray(nums,k, nums.length - 1);
+};
+
+var reversePortionOfArray = function(nums,start,end) {
+    while(start < end) {
+        [nums[start],nums[end]] = [nums[end],nums[start]];
+        start++;
+        end--;
+    }    
+}