neetcode-gh
diff --git a/Diff for: ‎java/24 Swap Nodes in Pairs.java renamed to ‎java/0024-swap-nodes-in-pairs.java b/Diff for: ‎java/24 Swap Nodes in Pairs.java renamed to ‎java/0024-swap-nodes-in-pairs.java
diff --git a/Diff for: ‎java/37-Sudoku-Solver.java renamed to ‎java/0037-sudoku-solver.java b/Diff for: ‎java/37-Sudoku-Solver.java renamed to ‎java/0037-sudoku-solver.java
diff --git a/Diff for: ‎java/60-Permutation-Sequence.java renamed to ‎java/0060-permutation-sequence.java b/Diff for: ‎java/60-Permutation-Sequence.java renamed to ‎java/0060-permutation-sequence.java
diff --git a/Diff for: ‎java/63-Unique-Paths-II.java renamed to ‎java/0063-unique-paths-ii.java b/Diff for: ‎java/63-Unique-Paths-II.java renamed to ‎java/0063-unique-paths-ii.java
diff --git a/Diff for: ‎java/81-Search-In-Rotated-Sorted-Array-II.java renamed to ‎java/0081-search-in-rotated-sorted-array-ii.java b/Diff for: ‎java/81-Search-In-Rotated-Sorted-Array-II.java renamed to ‎java/0081-search-in-rotated-sorted-array-ii.java
diff --git a/Diff for: ‎java/83. Remove Duplicates from Sorted List.java renamed to ‎java/0083-remove-duplicates-from-sorted-list.java b/Diff for: ‎java/83. Remove Duplicates from Sorted List.java renamed to ‎java/0083-remove-duplicates-from-sorted-list.java
diff --git a/Diff for: ‎java/106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.java renamed to ‎java/0106-construct-binary-tree-from-inorder-and-postorder-traversal.java b/Diff for: ‎java/106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.java renamed to ‎java/0106-construct-binary-tree-from-inorder-and-postorder-traversal.java
diff --git a/Diff for: ‎java/107-Binary-Tree-Level-Order-Traversal-II.java renamed to ‎java/0107-binary-tree-level-order-traversal-ii.java b/Diff for: ‎java/107-Binary-Tree-Level-Order-Traversal-II.java renamed to ‎java/0107-binary-tree-level-order-traversal-ii.java
diff --git a/Diff for: ‎java/112-Path-Sum.java renamed to ‎java/0112-path-sum.java b/Diff for: ‎java/112-Path-Sum.java renamed to ‎java/0112-path-sum.java
diff --git a/Diff for: ‎java/119-Pascal's-Triangle-II.java renamed to ‎java/0119-pascals-triangle-ii.java b/Diff for: ‎java/119-Pascal's-Triangle-II.java renamed to ‎java/0119-pascals-triangle-ii.java
diff --git a/Diff for: ‎java/234. Palindrome Linked List.java renamed to ‎java/0234-palindrome-linked-list.java b/Diff for: ‎java/234. Palindrome Linked List.java renamed to ‎java/0234-palindrome-linked-list.java
diff --git a/Diff for: ‎java/236-Lowest-Common-Ancestor-of-a-Binary-Tree.java renamed to ‎java/0236-lowest-common-ancestor-of-a-binary-tree.java b/Diff for: ‎java/236-Lowest-Common-Ancestor-of-a-Binary-Tree.java renamed to ‎java/0236-lowest-common-ancestor-of-a-binary-tree.java
diff --git a/Diff for: ‎java/283-move-zeros.java renamed to ‎java/0283-move-zeros.java b/Diff for: ‎java/283-move-zeros.java renamed to ‎java/0283-move-zeros.java
diff --git a/Diff for: ‎java/342-Power-of-Four.java renamed to ‎java/0342-power-of-four.java b/Diff for: ‎java/342-Power-of-Four.java renamed to ‎java/0342-power-of-four.java
diff --git a/Diff for: ‎java/605-Can-Place-Flowers.java renamed to ‎java/0605-can-place-flowers.java b/Diff for: ‎java/605-Can-Place-Flowers.java renamed to ‎java/0605-can-place-flowers.java
diff --git a/Diff for: ‎java/637-Average-of-Levels-in-Binary-Tree.java renamed to ‎java/0637-average-of-levels-in-binary-tree.java b/Diff for: ‎java/637-Average-of-Levels-in-Binary-Tree.java renamed to ‎java/0637-average-of-levels-in-binary-tree.java
diff --git a/Diff for: ‎java/662-Maximum-Width-of-Binary-Tree.java renamed to ‎java/0662-maximum-width-of-binary-tree.java b/Diff for: ‎java/662-Maximum-Width-of-Binary-Tree.java renamed to ‎java/0662-maximum-width-of-binary-tree.java
diff --git a/Diff for: ‎java/669-Trim-a-Binary-Search-Tree.java renamed to ‎java/0669-trim-a-binary-search-tree.java
+15-15 b/Diff for: ‎java/669-Trim-a-Binary-Search-Tree.java renamed to ‎java/0669-trim-a-binary-search-tree.java
+15-15
diff --git a/Diff for: ‎java/713-Subarray-Product-Less-Than-K.java renamed to ‎java/0713-subarray-product-less-than-k.java b/Diff for: ‎java/713-Subarray-Product-Less-Than-K.java renamed to ‎java/0713-subarray-product-less-than-k.java
diff --git a/Diff for: ‎java/779-K-th-Symbol-in-Grammar.java renamed to ‎java/0779-k-th-symbol-in-grammar.java b/Diff for: ‎java/779-K-th-Symbol-in-Grammar.java renamed to ‎java/0779-k-th-symbol-in-grammar.java
diff --git a/Diff for: ‎java/797-All-Paths-From-Source-to-Target.java renamed to ‎java/0797-all-paths-from-source-to-target.java b/Diff for: ‎java/797-All-Paths-From-Source-to-Target.java renamed to ‎java/0797-all-paths-from-source-to-target.java
diff --git a/Diff for: ‎java/852. Peak Index in a Mountain Array.java renamed to ‎java/0852-peak-index-in-a-mountain-array.java b/Diff for: ‎java/852. Peak Index in a Mountain Array.java renamed to ‎java/0852-peak-index-in-a-mountain-array.java
diff --git a/Diff for: ‎java/863-All-Nodes-Distance-K-in-Binary-Tree.java renamed to ‎java/0863-all-nodes-distance-k-in-binary-tree.java b/Diff for: ‎java/863-All-Nodes-Distance-K-in-Binary-Tree.java renamed to ‎java/0863-all-nodes-distance-k-in-binary-tree.java
diff --git a/Diff for: ‎java/876. Middle of the Linked List.java renamed to ‎java/0876-middle-of-the-linked-list.java b/Diff for: ‎java/876. Middle of the Linked List.java renamed to ‎java/0876-middle-of-the-linked-list.java
diff --git a/Diff for: ‎java/2309.-Greatest-English-Letter-in-Upper-and-Lower-Case.java renamed to ‎java/2309-greatest-english-letter-in-upper-and-lower-case.java b/Diff for: ‎java/2309.-Greatest-English-Letter-in-Upper-and-Lower-Case.java renamed to ‎java/2309-greatest-english-letter-in-upper-and-lower-case.java
@@ -1,16 +1,16 @@
-class Solution {
-    public TreeNode trimBST(TreeNode root, int low, int high) {
-        if(root == null){
-            return root;
-        }
-        if(root.val > high){
-            return trimBST(root.left, low, high);
-        }
-        if(root.val < low){
-            return trimBST(root.right, low, high);
-        }
-        root.left = trimBST(root.left, low, high);
-        root.right = trimBST(root.right, low, high);
-        return root;
-    }
+class Solution {
+    public TreeNode trimBST(TreeNode root, int low, int high) {
+        if(root == null){
+            return root;
+        }
+        if(root.val > high){
+            return trimBST(root.left, low, high);
+        }
+        if(root.val < low){
+            return trimBST(root.right, low, high);
+        }
+        root.left = trimBST(root.left, low, high);
+        root.right = trimBST(root.right, low, high);
+        return root;
+    }
 }