From a0096995fce682b368cf391ae57a68c1326854f3 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Mon, 13 Jun 2022 13:40:37 -0400
Subject: [PATCH 01/20] updated readme with my links

---
 README.md        | 50 +++--------------------------------
 easy/twosum-1.md | 69 ------------------------------------------------
 2 files changed, 4 insertions(+), 115 deletions(-)
 delete mode 100644 easy/twosum-1.md

diff --git a/README.md b/README.md
index 4364cb0..90723fb 100644
--- a/README.md
+++ b/README.md
@@ -1,10 +1,10 @@
-# Grind75 Solutions & Resources: JavaScript
+# Grind75 Solutions: JavaScript
 
 As I work through this list I figure I would make a GitHub repo with my solutions along with articles and videos that relate to the problems that I've found helpful. 
 
 ## The problems
-1. [Two Sum](https://github.com/curtisbarnard/leetcode-grind75-javascript/blob/main/easy/twosum-1.md)
-2. Valid Parentheses
+1. [Two Sum](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/1-2sum.js)
+2. [Valid Parentheses](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/20-validParentheses.js)
 3. Merge Two Sorted Lists
 4. Best Time to Buy and Sell Stock
 5. Valid Palindrome
@@ -79,49 +79,7 @@ As I work through this list I figure I would make a GitHub repo with my solution
 74. Merge k Sorted Lists
 75. Largest Rectangle in Histogram
 
-
-## Data Structures
-In order to practice with similar data structures I'll be placing each problem in the categories below, along with some similar problems nested below to help practice with those data structures.
-
-### Array
-1. [Two Sum](https://github.com/curtisbarnard/leetcode-grind75-javascript/blob/main/easy/twosum-1.md)
-
-### Hash Table
-1. [Two Sum](https://github.com/curtisbarnard/leetcode-grind75-javascript/blob/main/easy/twosum-1.md)
-
-## Algorithm Patterns
-Within the problems above there are several patterns that often occur. I plan to categorize each problem such that if you are having problem with a particular pattern you can look for other similar problems that use the same pattern.
-
-### Sliding Window
-
-### Two Pointers
-
-### Fast & Slow Pointers
-
-### Merge Intervals
-
-### Cyclic Sort
-
-### In-place Reversal of Linked List
-
-### Tree Breadth First Search
-
-### Tree Depth First Search
-
-### Two Heaps
-
-### Subsets
-
-### Modified Binary Search
-
-### Top K Elements
-
-### K-Way Merge
-
-### Topological Sort
-
-
-
 ## Attribution
 - The original Grind 75 list can be found [here](https://www.techinterviewhandbook.org/grind75)
 - The original list of patterns was sourced from [here](https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed)
+- The original markdown file can be found [here](https://github.com/curtisbarnard/leetcode-grind75-javascript)
diff --git a/easy/twosum-1.md b/easy/twosum-1.md
deleted file mode 100644
index 396890a..0000000
--- a/easy/twosum-1.md
+++ /dev/null
@@ -1,69 +0,0 @@
-# Two Sum
-
-Page on leetcode: https://leetcode.com/problems/two-sum/
-
-## Problem Statement
-
-Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
-You may assume that each input would have exactly one solution, and you may not use the same element twice.
-You can return the answer in any order.
-**Follow-up:** Can you come up with an algorithm that is less than O(n2) time complexity?
-
-### Constraints
-
-- 2 <= nums.length <= 104
-- -109 <= nums[i] <= 109
-- -109 <= target <= 109
-- Only one valid answer exists.
-
-### Example
-
-Input: nums = [2,7,11,15], target = 9
-Output: [0,1]
-Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
-
-## Solution
-
-### Pseudocode
-
-1. Shift first element from array store in var
-2. loop thru array
-3. check var + num[i] === target
-4. If not successful shift next element and repeat
-
-### Initial Solution
-
-This solution has a time complexity O(n<sup>2</sup>)
-
-```javascript
-var twoSum = function (nums, target) {
-  const initialLength = nums.length;
-  for (let i = 0; i < initialLength; i++) {
-    let testNum = nums.shift();
-    for (let j = 0; j < nums.length; j++) {
-      if (testNum + nums[j] === target) {
-        return [i, i + j + 1];
-      }
-    }
-  }
-};
-```
-
-### Optimized Solution
-
-Using a map (hash map) reduces the time complexity to O(n). Here is a good video with an explanation: https://www.youtube.com/watch?v=KLlXCFG5TnA
-
-```javascript
-var twoSum = function (nums, target) {
-  const map = new Map();
-  for (let i = 0; i < nums.length; i++) {
-    const n = nums[i];
-    if (map.has(target - n)) {
-      return [map.get(target - n), i];
-    } else {
-      map.set(n, i);
-    }
-  }
-  return [];
-};
-```

From bcdec20796e9386941e7bd76ff204914a515f3bc Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Mon, 13 Jun 2022 13:42:54 -0400
Subject: [PATCH 02/20] updated description

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 90723fb..4e1277f 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,6 @@
 # Grind75 Solutions: JavaScript
 
-As I work through this list I figure I would make a GitHub repo with my solutions along with articles and videos that relate to the problems that I've found helpful. 
+Grind75 Solutions in JavaScript with comments explaining my thought process and the code, links to the original problem, the instructions, and some test cases
 
 ## The problems
 1. [Two Sum](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/1-2sum.js)

From 53d8146a9a0f987bba1276ea7b14156f0eb76c80 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Tue, 14 Jun 2022 18:31:47 -0400
Subject: [PATCH 03/20] added merge two sorted lists

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 4e1277f..0c34470 100644
--- a/README.md
+++ b/README.md
@@ -5,7 +5,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 ## The problems
 1. [Two Sum](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/1-2sum.js)
 2. [Valid Parentheses](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/20-validParentheses.js)
-3. Merge Two Sorted Lists
+3. [Merge Two Sorted Lists](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/21-mergeTwoSortedLists.js)
 4. Best Time to Buy and Sell Stock
 5. Valid Palindrome
 6. Invert Binary Tree

From 80482a677cccc171183fe620e95c4f10ea53ee44 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Wed, 15 Jun 2022 02:47:00 -0400
Subject: [PATCH 04/20] added best time to sell stock and valid palindrome

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index 0c34470..49bcdda 100644
--- a/README.md
+++ b/README.md
@@ -6,8 +6,8 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 1. [Two Sum](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/1-2sum.js)
 2. [Valid Parentheses](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/20-validParentheses.js)
 3. [Merge Two Sorted Lists](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/21-mergeTwoSortedLists.js)
-4. Best Time to Buy and Sell Stock
-5. Valid Palindrome
+4. [Best Time to Buy and Sell Stock](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/121-bestTimeToSellAndBuyStock.js)
+5. [Valid Palindrome](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/125-validPalindrome.js)
 6. Invert Binary Tree
 7. Valid Anagram
 8. Binary Search

From 56602837336d5268d3cc03eef6c44cfa54e41bac Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Wed, 15 Jun 2022 11:37:01 -0400
Subject: [PATCH 05/20] added valid anagram

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 49bcdda..c559fd5 100644
--- a/README.md
+++ b/README.md
@@ -9,7 +9,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 4. [Best Time to Buy and Sell Stock](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/121-bestTimeToSellAndBuyStock.js)
 5. [Valid Palindrome](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/125-validPalindrome.js)
 6. Invert Binary Tree
-7. Valid Anagram
+7. [Valid Anagram](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/242-validAnagram.js)
 8. Binary Search
 9. Flood Fill
 10. Maximum Subarray

From 2eeda3cc7f1399d4a34e5dd688c505345a081082 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Thu, 16 Jun 2022 21:41:54 -0400
Subject: [PATCH 06/20] add invert binary tree

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index c559fd5..e7be980 100644
--- a/README.md
+++ b/README.md
@@ -8,7 +8,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 3. [Merge Two Sorted Lists](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/21-mergeTwoSortedLists.js)
 4. [Best Time to Buy and Sell Stock](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/121-bestTimeToSellAndBuyStock.js)
 5. [Valid Palindrome](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/125-validPalindrome.js)
-6. Invert Binary Tree
+6. [Invert Binary Tree](https://github.com/20jasper/codewars-and-leetcode/commit/39cdfc75925f09b123d6c9cd8d001ea0da288508)
 7. [Valid Anagram](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/242-validAnagram.js)
 8. Binary Search
 9. Flood Fill

From 75a8dccb639a766ed17f21f64e26123db6c5603a Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Fri, 17 Jun 2022 10:49:33 -0400
Subject: [PATCH 07/20] added binary search and fixed invert binary tree link

---
 README.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md
index e7be980..f3d0323 100644
--- a/README.md
+++ b/README.md
@@ -8,9 +8,9 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 3. [Merge Two Sorted Lists](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/21-mergeTwoSortedLists.js)
 4. [Best Time to Buy and Sell Stock](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/121-bestTimeToSellAndBuyStock.js)
 5. [Valid Palindrome](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/125-validPalindrome.js)
-6. [Invert Binary Tree](https://github.com/20jasper/codewars-and-leetcode/commit/39cdfc75925f09b123d6c9cd8d001ea0da288508)
+6. [Invert Binary Tree](https://github.com/20jasper/codewars-and-leetcode/blob/47634f23a4ea9a45a9bcf43c8a16eb516f2f9949/LeetCode/226-invertBinaryTree.js)
 7. [Valid Anagram](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/242-validAnagram.js)
-8. Binary Search
+8. [Binary Search](https://github.com/20jasper/codewars-and-leetcode/blob/47634f23a4ea9a45a9bcf43c8a16eb516f2f9949/LeetCode/704-binarySearch.js)
 9. Flood Fill
 10. Maximum Subarray
 11. Lowest Common Ancestor of a Binary Search Tree

From 182fccad50da0e942a398077db734bacb00caead Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Sat, 18 Jun 2022 00:41:50 -0400
Subject: [PATCH 08/20] added flood fill

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index f3d0323..825aec9 100644
--- a/README.md
+++ b/README.md
@@ -11,7 +11,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 6. [Invert Binary Tree](https://github.com/20jasper/codewars-and-leetcode/blob/47634f23a4ea9a45a9bcf43c8a16eb516f2f9949/LeetCode/226-invertBinaryTree.js)
 7. [Valid Anagram](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/242-validAnagram.js)
 8. [Binary Search](https://github.com/20jasper/codewars-and-leetcode/blob/47634f23a4ea9a45a9bcf43c8a16eb516f2f9949/LeetCode/704-binarySearch.js)
-9. Flood Fill
+9. [Flood Fill](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/733-floodFill.js)
 10. Maximum Subarray
 11. Lowest Common Ancestor of a Binary Search Tree
 12. Balanced Binary Tree

From 147bb3c2118aa9af5124adc8ab96dd31a0d1c86e Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Sun, 19 Jun 2022 01:03:33 -0400
Subject: [PATCH 09/20] added maximun subarray

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 825aec9..ec363fb 100644
--- a/README.md
+++ b/README.md
@@ -12,7 +12,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 7. [Valid Anagram](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/242-validAnagram.js)
 8. [Binary Search](https://github.com/20jasper/codewars-and-leetcode/blob/47634f23a4ea9a45a9bcf43c8a16eb516f2f9949/LeetCode/704-binarySearch.js)
 9. [Flood Fill](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/733-floodFill.js)
-10. Maximum Subarray
+10. [Maximum Subarray](https://github.com/20jasper/codewars-and-leetcode/blob/a6ba1fa2a4a8cab3bcef31ac5e6cff4187be7b43/LeetCode/53-maximumSubarray.js)
 11. Lowest Common Ancestor of a Binary Search Tree
 12. Balanced Binary Tree
 13. Linked List Cycle

From afbafa51614590f061bc780f89922f1ecfcaba42 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Mon, 20 Jun 2022 00:42:03 -0400
Subject: [PATCH 10/20] added lowest common ancestor

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index ec363fb..db14f0e 100644
--- a/README.md
+++ b/README.md
@@ -13,7 +13,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 8. [Binary Search](https://github.com/20jasper/codewars-and-leetcode/blob/47634f23a4ea9a45a9bcf43c8a16eb516f2f9949/LeetCode/704-binarySearch.js)
 9. [Flood Fill](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/733-floodFill.js)
 10. [Maximum Subarray](https://github.com/20jasper/codewars-and-leetcode/blob/a6ba1fa2a4a8cab3bcef31ac5e6cff4187be7b43/LeetCode/53-maximumSubarray.js)
-11. Lowest Common Ancestor of a Binary Search Tree
+11. [Lowest Common Ancestor of a Binary Search Tree](https://github.com/20jasper/codewars-and-leetcode/blob/70e7232f81/LeetCode/235-lowestCommonAncestorOfABinarySearchTree.js)
 12. Balanced Binary Tree
 13. Linked List Cycle
 14. Implement Queue using Stacks

From a391f8bfb18fcc7fa3932a3c95e5c43cd8573192 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Fri, 1 Jul 2022 10:26:45 -0400
Subject: [PATCH 11/20] contains duplicate

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index db14f0e..812d1e0 100644
--- a/README.md
+++ b/README.md
@@ -28,7 +28,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 23. Diameter of Binary Tree
 24. Middle of the Linked List
 25. Maximum Depth of Binary Tree
-26. Contains Duplicate
+26. [Contains Duplicate](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/217-containsDuplicate.js)
 27. Insert Interval
 28. 01 Matrix
 29. K Closest Points to Origin

From fc409edfb9e86e2ddec48f150aeea4393f7c597f Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Tue, 5 Jul 2022 20:43:36 -0400
Subject: [PATCH 12/20] merge intervals

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 812d1e0..183907d 100644
--- a/README.md
+++ b/README.md
@@ -47,7 +47,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 42. Search in Rotated Sorted Array
 43. Combination Sum
 44. Permutations
-45. Merge Intervals
+45. [Merge Intervals](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/56-mergeIntervals.js)
 46. Lowest Common Ancestor of a Binary Tree
 47. Time Based Key-Value Store
 48. Accounts Merge

From 7008f8664e209a4f16d3687b1374f14207221fcb Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Wed, 27 Jul 2022 15:17:29 -0400
Subject: [PATCH 13/20] number of islands

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 183907d..522f9c2 100644
--- a/README.md
+++ b/README.md
@@ -42,7 +42,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 37. Coin Change
 38. Product of Array Except Self
 39. Validate Binary Search Tree
-40. Number of Islands
+40. [Number of Islands](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/200-numberOfIslands.js)
 41. Rotting Oranges
 42. Search in Rotated Sorted Array
 43. Combination Sum

From 0c7748e75c3e628057196071207cf5b26318d373 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Wed, 27 Jul 2022 15:18:38 -0400
Subject: [PATCH 14/20] spiral matrix

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 522f9c2..7f3e36c 100644
--- a/README.md
+++ b/README.md
@@ -55,7 +55,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 50. Word Break
 51. Partition Equal Subset Sum
 52. String to Integer (atoi)
-53. Spiral Matrix
+53. [Spiral Matrix](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/54-spiralMatrix.js)
 54. Subsets
 55. Binary Tree Right Side View
 56. Longest Palindromic Substring

From e1d168dd8fae7d6fa222e7d6b4573314e97a0d52 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Wed, 27 Jul 2022 15:19:44 -0400
Subject: [PATCH 15/20] deleted non used link

---
 README.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/README.md b/README.md
index 7f3e36c..2b41a10 100644
--- a/README.md
+++ b/README.md
@@ -81,5 +81,4 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 
 ## Attribution
 - The original Grind 75 list can be found [here](https://www.techinterviewhandbook.org/grind75)
-- The original list of patterns was sourced from [here](https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed)
 - The original markdown file can be found [here](https://github.com/curtisbarnard/leetcode-grind75-javascript)

From 8e16940f278fb365efea542dc93253e019f1bafe Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Fri, 12 Aug 2022 17:57:35 -0400
Subject: [PATCH 16/20] added product of array except self

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 2b41a10..01a1d3f 100644
--- a/README.md
+++ b/README.md
@@ -40,7 +40,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 35. Course Schedule
 36. Implement Trie (Prefix Tree)
 37. Coin Change
-38. Product of Array Except Self
+38. [Product of Array Except Self](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/238-productOfArrayExceptSelf.js)
 39. Validate Binary Search Tree
 40. [Number of Islands](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/200-numberOfIslands.js)
 41. Rotting Oranges

From 13243e435a0c99804ce362ed77c82db645e7d8ae Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Sat, 13 Aug 2022 14:36:31 -0400
Subject: [PATCH 17/20] added three sum

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 01a1d3f..13167fb 100644
--- a/README.md
+++ b/README.md
@@ -33,7 +33,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 28. 01 Matrix
 29. K Closest Points to Origin
 30. Longest Substring Without Repeating Characters
-31. 3Sum
+31. [3Sum](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/15-3sum.js)
 32. Binary Tree Level Order Traversal
 33. Clone Graph
 34. Evaluate Reverse Polish Notation

From 03d5186f7e457e7cf835aa8ca85c7a1f8fe50d59 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Sat, 13 Aug 2022 18:31:46 -0400
Subject: [PATCH 18/20] container with most water

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 13167fb..f805d31 100644
--- a/README.md
+++ b/README.md
@@ -61,7 +61,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 56. Longest Palindromic Substring
 57. Unique Paths
 58. Construct Binary Tree from Preorder and Inorder Traversal
-59. Container With Most Water
+59. [Container With Most Water](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/11-containerWithMostWater.js)
 60. Letter Combinations of a Phone Number
 61. Word Search
 62. Find All Anagrams in a String

From 947906e184be62e1f84e7654db86867ac62b3ff3 Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Sun, 21 Aug 2022 23:37:34 -0400
Subject: [PATCH 19/20] longest substring without repeating characters

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index f805d31..485afef 100644
--- a/README.md
+++ b/README.md
@@ -32,7 +32,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 27. Insert Interval
 28. 01 Matrix
 29. K Closest Points to Origin
-30. Longest Substring Without Repeating Characters
+30. [Longest Substring Without Repeating Characters](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/3-longestSubstringWithoutRepeatingCharacters.js)
 31. [3Sum](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/15-3sum.js)
 32. Binary Tree Level Order Traversal
 33. Clone Graph

From 633eaff398134a7079d8fc9467048c5fdf919bdc Mon Sep 17 00:00:00 2001
From: Jacob Asper <jacobasper191@gmail.com>
Date: Sun, 21 Aug 2022 23:39:13 -0400
Subject: [PATCH 20/20] trapping rain water

---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index 485afef..82383e4 100644
--- a/README.md
+++ b/README.md
@@ -71,7 +71,7 @@ Grind75 Solutions in JavaScript with comments explaining my thought process and
 66. Kth Smallest Element in a BST
 67. Minimum Window Substring
 68. Serialize and Deserialize Binary Tree
-69. Trapping Rain Water
+69. [Trapping Rain Water](https://github.com/20jasper/codewars-and-leetcode/blob/main/LeetCode/42-trappingRainWater.js)
 70. Find Median from Data Stream
 71. Word Ladder
 72. Basic Calculator
