160th Commit

README.md

@@ -144,7 +144,7 @@ Ace Coding Interview with 75 Qs
 | 206. Reverse Linked List                      | [Solution][206] | Easy   |
 | 2130. Maximum Twin Sum of a Linked List       | Solution        | Medium |
 
-[206]: ./src//page-2/206.%20Reverse%20Linked%20List/reverse-list.ts
+[206]: ./src/page-2/206.%20Reverse%20Linked%20List/reverseList.ts
 
 | Binary Tree - DFS                            |                 |        |
 | -------------------------------------------- | --------------- | ------ |
@@ -155,7 +155,7 @@ Ace Coding Interview with 75 Qs
 | 1372. Longest ZigZag Path in a Binary Tree   | Solution        | Medium |
 | 236. Lowest Common Ancestor of a Binary Tree | Solution        | Medium |
 
-[104]: ./src//page-2/104.%20Maximum%20Depth%20of%20Binary%20Tree/max-depth.ts
+[104]: ./src/page-2/104.%20Maximum%20Depth%20of%20Binary%20Tree/maxDepth.ts
 
 | Binary Tree - BFS                        |          |        |
 | ---------------------------------------- | -------- | ------ |
@@ -218,8 +218,8 @@ Ace Coding Interview with 75 Qs
 | 136. Single Number                            | [Solution][136] | Easy   |
 | 1318. Minimum Flips to Make a OR b Equal to c | Solution        | Medium |
 
-[338]: ./src/page-4/338.%20Counting%20Bits/count-bits.ts
-[136]: ./src/page-2/136.%20Single%20Number/single-number.ts
+[338]: ./src/page-4/338.%20Counting%20Bits/countBits.ts
+[136]: ./src/page-2/136.%20Single%20Number/singleNumber.ts
 
 | Trie                              |          |        |
 | --------------------------------- | -------- | ------ |
@@ -282,7 +282,7 @@ Must-do List for Interview Prep
 [26]: ./src/page-1/26.%20Remove%20Duplicates%20from%20Sorted%20Array/removeDuplicates.ts
 [189]: ./src/page-2/189.%20Rotate%20Array/rotate.ts
 [13]: ./src/page-1/13.%20Roman%20to%20Integer/romanToInt.ts
-[58]: ./src/page-1/58.%20Length%20of%20Last%20Word/length-of-last-word.ts
+[58]: ./src/page-1/58.%20Length%20of%20Last%20Word/lengthOfLastWord.ts
 [14]: ./src/page-1/14.%20Longest%20Common%20Prefix/longestCommonPrefix.ts
 [6]: ./src/page-1/6.%20Zigzag%20Conversion/convert.ts
 [28]: ./src/page-1/28.%20Find%20the%20Index%20of%20the%20First%20Occurrence%20in%20a%20String/strStr.ts
@@ -343,7 +343,7 @@ Must-do List for Interview Prep
 | 224. Basic Calculator                 | Solution        | Hard   |
 
 [20]: ./src/page-1/20.%20Valid%20Parentheses/isValid.ts
-[155]: ./src/page-2/155.%20Min%20Stack/min-stack.ts
+[155]: ./src/page-2/155.%20Min%20Stack/MinStack.ts
 
 | Linked List                               |                 |        |
 | ----------------------------------------- | --------------- | ------ |
@@ -359,7 +359,7 @@ Must-do List for Interview Prep
 | 86. Partition List                        | Solution        | Medium |
 | 146. LRU Cache                            | Solution        | Medium |
 
-[141]: ./src/page-2/141.%20Linked%20List%20Cycle/has-cycle.ts
+[141]: ./src/page-2/141.%20Linked%20List%20Cycle/hasCycle.ts
 [2]: ./src/page-1/2.%20Add%20Two%20Numbers/addTwoNumbers.ts
 [21]: ./src/page-1/21.%20Merge%20Two%20Sorted%20Lists/mergeTwoLists.ts
 
@@ -380,10 +380,10 @@ Must-do List for Interview Prep
 | 222. Count Complete Tree Nodes                                  | Solution        | Easy   |
 | 236. Lowest Common Ancestor of a Binary Tree                    | Solution        | Medium |
 
-[104]: ./src/page-2/104.%20Maximum%20Depth%20of%20Binary%20Tree/max-depth.ts
+[104]: ./src/page-2/104.%20Maximum%20Depth%20of%20Binary%20Tree/maxDepth.ts
 [100]: ./src/page-1/100.%20Same%20Tree/isSameTree.ts
-[101]: ./src/page-2/101.%20Symmetric%20Tree/is-symmetric.ts
-[112]: ./src/page-2/112.%20Path%20Sum/has-path-sum.ts
+[101]: ./src/page-2/101.%20Symmetric%20Tree/isSymmetric.ts
+[112]: ./src/page-2/112.%20Path%20Sum/hasPathSum.ts
 
 | Binary Tree BFS                               |          |        |
 | --------------------------------------------- | -------- | ------ |
@@ -443,7 +443,7 @@ Must-do List for Interview Prep
 | 53. Maximum Subarray               | [Solution][53] | Medium |
 | 918. Maximum Sum Circular Subarray | Solution       | Medium |
 
-[53]: ./src/page-1/53.%20Maximum%20Subarray/max-sub-array.ts
+[53]: ./src/page-1/53.%20Maximum%20Subarray/maxSubArray.ts
 
 | Binary Search                                               |                |        |
 | ----------------------------------------------------------- | -------------- | ------ |
@@ -455,8 +455,8 @@ Must-do List for Interview Prep
 | 153. Find Minimum in Rotated Sorted Array                   | Solution       | Medium |
 | 4. Median of Two Sorted Arrays                              | [Solution][4]  | Hard   |
 
-[35]: ./src/page-1/35.%20Search%20Insert%20Position/search-insert.ts
-[34]: ./src/page-1/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/search-range.ts
+[35]: ./src/page-1/35.%20Search%20Insert%20Position/searchInsert.ts
+[34]: ./src/page-1/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array/searchRange.ts
 [4]: ./src/page-1/4.%20Median%20of%20Two%20Sorted%20Arrays/findMedianSortedArrays.ts
 
 | Heap                                 |          |        |
@@ -475,10 +475,10 @@ Must-do List for Interview Prep
 | 137. Single Number II             | Solution        | Medium |
 | 201. Bitwise AND of Numbers Range | Solution        | Medium |
 
-[67]: ./src/page-1/67.%20Add%20Binary/add-binary.ts
-[190]: ./src/page-2/190.%20Reverse%20Bits/reverse-bits.ts
-[191]: ./src/page-2/191.%20Number%20of%201%20Bits/hamming-weight.ts
-[136]: ./src/page-2/136.%20Single%20Number/single-number.ts
+[67]: ./src/page-1/67.%20Add%20Binary/addBinary.ts
+[190]: ./src/page-2/190.%20Reverse%20Bits/reverseBits.ts
+[191]: ./src/page-2/191.%20Number%20of%201%20Bits/hammingWeight.ts
+[136]: ./src/page-2/136.%20Single%20Number/singleNumber.ts
 
 | Math                           |                |        |
 | ------------------------------ | -------------- | ------ |
@@ -490,9 +490,9 @@ Must-do List for Interview Prep
 | 149. Max Points on a Line      | Solution       | Hard   |
 
 [9]: ./src/page-1/9.%20Palindrome%20Number/isPalindrome.ts
-[66]: ./src/page-1/66.%20Plus%20One/plus-one.ts
-[69]: ./src/page-1/69.%20Sqrt(x)/my-sqrt.ts
-[50]: ./src/page-1/50.%20Pow(x,%20n)/pow.ts
+[66]: ./src/page-1/66.%20Plus%20One/plusOne.ts
+[69]: ./src/page-1/69.%20Sqrt(x)/mySqrt.ts
+[50]: ./src/page-1/50.%20Pow(x,%20n)/myPow.ts
 
 | 1D DP                               |                |        |
 | ----------------------------------- | -------------- | ------ |
@@ -502,7 +502,7 @@ Must-do List for Interview Prep
 | 322. Coin Change                    | Solution       | Medium |
 | 300. Longest Increasing Subsequence | Solution       | Medium |
 
-[70]: ./src/page-1/70.%20Climbing%20Stairs/climb-stairs.ts
+[70]: ./src/page-1/70.%20Climbing%20Stairs/climbStairs.ts
 
 | Multidimensional DP                      |               |        |
 | ---------------------------------------- | ------------- | ------ |

src/page-2/101. Symmetric Tree/is-symmetric.test.ts → src/page-2/101. Symmetric Tree/isSymmetric.test.ts

@@ -1,6 +1,6 @@
 import { generateBinaryTree } from '~/utils/binary-tree';
 
-import { isSymmetric } from './is-symmetric';
+import { isSymmetric } from './isSymmetric';
 
 describe('101. Symmetric Tree', () => {
   test('isSymmetric', () => {

src/page-2/104. Maximum Depth of Binary Tree/max-depth.test.ts → src/page-2/104. Maximum Depth of Binary Tree/maxDepth.test.ts

@@ -1,6 +1,6 @@
 import { generateBinaryTree } from '~/utils/binary-tree';
 
-import { maxDepth } from './max-depth';
+import { maxDepth } from './maxDepth';
 
 describe('104. Maximum Depth of Binary Tree', () => {
   test('maxDepth', () => {

src/page-2/107. Binary Tree Level Order Traversal II/level-order-bottom.test.ts → src/page-2/107. Binary Tree Level Order Traversal II/levelOrderBottom.test.ts

@@ -1,6 +1,6 @@
 import { generateBinaryTree } from '~/utils/binary-tree';
 
-import { levelOrderBottom } from './level-order-bottom';
+import { levelOrderBottom } from './levelOrderBottom';
 
 describe('107. Binary Tree Level Order Traversal II', () => {
   test('levelOrderBottom', () => {

src/page-2/111. Minimum Depth of Binary Tree/min-depth.test.ts → src/page-2/111. Minimum Depth of Binary Tree/minDepth.test.ts

@@ -1,6 +1,6 @@
 import { generateBinaryTree } from '~/utils/binary-tree';
 
-import { minDepth } from './min-depth';
+import { minDepth } from './minDepth';
 
 describe('111. Minimum Depth of Binary Tree', () => {
   test('minDepth', () => {

src/page-2/112. Path Sum/has-path-sum.test.ts → src/page-2/112. Path Sum/hasPathSum.test.ts

@@ -1,6 +1,6 @@
 import { generateBinaryTree } from '~/utils/binary-tree';
 
-import { hasPathSum } from './has-path-sum';
+import { hasPathSum } from './hasPathSum';
 
 describe('112. Path Sum', () => {
   test('hasPathSum', () => {

src/page-2/119. Pascal's Triangle II/get-row.test.ts → src/page-2/119. Pascal's Triangle II/getRow.test.ts

@@ -1,4 +1,4 @@
-import { getRow } from './get-row';
+import { getRow } from './getRow';
 
 describe("119. Pascal's Triangle II", () => {
   test('getRow', () => {

src/page-2/136. Single Number/single-number.test.ts → src/page-2/136. Single Number/singleNumber.test.ts

@@ -1,4 +1,4 @@
-import { singleNumber } from './single-number';
+import { singleNumber } from './singleNumber';
 
 describe('136. Single Number', () => {
   test('singleNumber', () => {

src/page-2/141. Linked List Cycle/has-cycle.spec.ts → src/page-2/141. Linked List Cycle/hasCycle.spec.ts

@@ -1,6 +1,6 @@
 import { generateLinkedListCycle } from '~/utils/linked-list';
 
-import { hasCycle } from './has-cycle';
+import { hasCycle } from './hasCycle';
 
 describe('141. Linked List Cycle', () => {
   test('hasCycle', () => {

src/page-2/155. Min Stack/min-stack.test.ts → src/page-2/155. Min Stack/MinStack.test.ts

@@ -1,4 +1,4 @@
-import { MinStack } from './min-stack';
+import { MinStack } from './MinStack';
 
 describe('155. Min Stack', () => {
   test('MinStack', () => {

src/page-2/155. Min Stack/MinStack.ts

@@ -0,0 +1,36 @@
+/**
+ * Accepted
+ */
+export class MinStack {
+  stack: number[];
+  minStack: number[];
+
+  constructor() {
+    this.stack = [];
+    this.minStack = [];
+  }
+
+  push(val: number): void {
+    this.stack.push(val);
+
+    if (!this.minStack.length || (this.minStack.length && this.getMin() >= val)) {
+      this.minStack.push(val);
+    }
+  }
+
+  pop(): void {
+    const removed = this.stack.pop();
+
+    if (this.getMin() === removed) {
+      this.minStack.pop();
+    }
+  }
+
+  top(): number {
+    return this.stack[this.stack.length - 1];
+  }
+
+  getMin(): number {
+    return this.minStack[this.minStack.length - 1];
+  }
+}

src/page-2/189. Rotate Array/rotate.test.ts

@@ -2,12 +2,16 @@ import { rotate } from './rotate';
 
 describe('189. Rotate Array', () => {
   test('rotate', () => {
-    const case1 = [1, 2, 3, 4, 5, 6, 7];
-    rotate(case1, 3);
-    expect(case1).toStrictEqual([5, 6, 7, 1, 2, 3, 4]);
+    {
+      const nums = [1, 2, 3, 4, 5, 6, 7];
+      rotate(nums, 3);
+      expect(nums).toStrictEqual([5, 6, 7, 1, 2, 3, 4]);
+    }
 
-    const case2 = [-1, -100, 3, 99];
-    rotate(case2, 2);
-    expect(case2).toStrictEqual([3, 99, -1, -100]);
+    {
+      const nums = [-1, -100, 3, 99];
+      rotate(nums, 2);
+      expect(nums).toStrictEqual([3, 99, -1, -100]);
+    }
   });
 });

src/page-2/190. Reverse Bits/reverse-bits.test.ts → src/page-2/190. Reverse Bits/reverseBits.test.ts

@@ -1,4 +1,4 @@
-import { reverseBits, reverseBits2 } from './reverse-bits';
+import { reverseBits, reverseBits2 } from './reverseBits';
 
 describe('190. Reverse Bits', () => {
   test('reverseBits', () => {

src/page-2/191. Number of 1 Bits/hamming-weight.test.ts → src/page-2/191. Number of 1 Bits/hammingWeight.test.ts

@@ -1,4 +1,4 @@
-import { hammingWeight } from './hamming-weight';
+import { hammingWeight } from './hammingWeight';
 
 describe('191. Number of 1 Bits', () => {
   test('hammingWeight', () => {

src/page-2/206. Reverse Linked List/reverse-list.test.ts → src/page-2/206. Reverse Linked List/reverseList.test.ts

@@ -2,7 +2,7 @@ import { stringify } from 'flatted';
 
 import { generateLinkedList } from '~/utils/linked-list';
 
-import { reverseList } from './reverse-list';
+import { reverseList } from './reverseList';
 
 describe('206. Reverse Linked List', () => {
   test('reverseList', () => {

src/page-3/231. Power of Two/is-power-of-two.test.ts → src/page-3/231. Power of Two/isPowerOfTwo.test.ts

@@ -1,4 +1,4 @@
-import { isPowerOfTwo, isPowerOfTwo2, isPowerOfTwo3 } from './is-power-of-two';
+import { isPowerOfTwo, isPowerOfTwo2, isPowerOfTwo3 } from './isPowerOfTwo';
 
 describe('231. Power of Two', () => {
   test('isPowerOfTwo', () => {

src/page-3/258. Add Digits/add-digits.test.ts → src/page-3/258. Add Digits/addDigits.test.ts

@@ -1,4 +1,4 @@
-import { addDigits, addDigits2, addDigits3, addDigits4, addDigits5 } from './add-digits';
+import { addDigits, addDigits2, addDigits3, addDigits4, addDigits5 } from './addDigits';
 
 describe('258. Add Digits', () => {
   test('addDigits', () => {

src/page-3/268. Missing Number/missing-number.test.ts → src/page-3/268. Missing Number/missingNumber.test.ts

@@ -1,4 +1,4 @@
-import { missingNumber } from './missing-number';
+import { missingNumber } from './missingNumber';
 
 describe('268. Missing Number', () => {
   test('missingNumber', () => {

src/page-4/326. Power of Three/is-power-of-three.test.ts → src/page-4/326. Power of Three/isPowerOfThree.test.ts

@@ -1,4 +1,4 @@
-import { isPowerOfThree, isPowerOfThree2, isPowerOfThree3 } from './is-power-of-three';
+import { isPowerOfThree, isPowerOfThree2, isPowerOfThree3 } from './isPowerOfThree';
 
 describe('326. Power of Three', () => {
   test('isPowerOfThree', () => {

src/page-4/338. Counting Bits/count-bits.test.ts → src/page-4/338. Counting Bits/countBits.test.ts

@@ -1,4 +1,4 @@
-import { countBits } from './count-bits';
+import { countBits } from './countBits';
 
 describe('338. Counting Bits', () => {
   test('countBits', () => {

src/page-4/344. Reverse String/reverse-string.test.ts → src/page-4/344. Reverse String/reverseString.test.ts

@@ -1,4 +1,4 @@
-import { reverseString, reverseString2 } from './reverse-string';
+import { reverseString, reverseString2 } from './reverseString';
 
 describe('344. Reverse String', () => {
   test('reverseString', () => {

src/page-4/371. Sum of Two Integers/get-sum.test.ts → src/page-4/371. Sum of Two Integers/getSum.test.ts

@@ -1,4 +1,4 @@
-import { getSum, getSum2 } from './get-sum';
+import { getSum, getSum2 } from './getSum';
 
 describe('371. Sum of Two Integers', () => {
   test('getSum', () => {

src/page-4/412. Fizz Buzz/fizz-buzz.test.ts → src/page-4/412. Fizz Buzz/fizzBuzz.test.ts

@@ -1,4 +1,4 @@
-import { fizzBuzz } from './fizz-buzz';
+import { fizzBuzz } from './fizzBuzz';
 
 describe('412. Fizz Buzz', () => {
   test('fizzBuzz', () => {

src/page-5/504. Base 7/convert-to-base7.test.ts → src/page-5/504. Base 7/convertToBase7.test.ts

@@ -1,4 +1,4 @@
-import { convertToBase7, convertToBase72 } from './convert-to-base7';
+import { convertToBase7, convertToBase72 } from './convertToBase7';
 
 describe('504. Base 7', () => {
   test('convertToBase7', () => {

src/page-6/648. Replace Words/replace-words.test.ts → src/page-6/648. Replace Words/replaceWords.test.ts

@@ -1,4 +1,4 @@
-import { replaceWords } from './replace-words';
+import { replaceWords } from './replaceWords';
 
 describe('648. Replace Words', () => {
   test('replaceWords', () => {