@@ -88,7 +88,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
8888|-|-|-|-|-|-
8989| 0334 |[ Increasing Triplet Subsequence] ( src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java ) | Medium | Top_Interview_Questions, Array, Greedy | 2 | 99.33
9090| 0238 |[ Product of Array Except Self] ( src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_ Space_O(n) | 1 | 100.00
91- | 0560 |[ Subarray Sum Equals K] ( src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java ) | Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum | 21 | 98.97
91+ | 0560 |[ Subarray Sum Equals K] ( src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java ) | Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n) _ Space_O(n) | 21 | 98.97
9292
9393####Day 6 String
9494
@@ -102,7 +102,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
102102|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
103103|-|-|-|-|-|-
104104| 0290 |[ Word Pattern] ( src/main/java/g0201_0300/s0290_word_pattern/Solution.java ) | Easy | String, Hash_Table | 1 | 97.26
105- | 0763 |[ Partition Labels] ( src/main/java/g0701_0800/s0763_partition_labels/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers | 1 | 100.00
105+ | 0763 |[ Partition Labels] ( src/main/java/g0701_0800/s0763_partition_labels/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n) _ Space_O(1) | 1 | 100.00
106106
107107####Day 8 String
108108
@@ -345,7 +345,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
345345
346346|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
347347|-|-|-|-|-|-
348- | 0438 |[ Find All Anagrams in a String] ( src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 6 | 99.03
348+ | 0438 |[ Find All Anagrams in a String] ( src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m) _ Space_O(1) | 6 | 99.03
349349| 0713 |[ Subarray Product Less Than K] ( src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java ) | Medium | Array, Sliding_Window | 8 | 39.00
350350| 0209 |[ Minimum Size Subarray Sum] ( src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java ) | Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
351351
@@ -433,7 +433,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
433433
434434|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
435435|-|-|-|-|-|-
436- | 1143 |[ Longest Common Subsequence] ( src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 33 | 46.23
436+ | 1143 |[ Longest Common Subsequence] ( src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n * m) _ Space_O(n * m) | 33 | 46.23
437437| 0583 |[ Delete Operation for Two Strings] ( src/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java ) | Medium | String, Dynamic_Programming | 12 | 79.10
438438
439439####Day 18 Dynamic Programming
@@ -825,7 +825,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
825825|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
826826|-|-|-|-|-|-
827827| 0392 |[ Is Subsequence] ( src/main/java/g0301_0400/s0392_is_subsequence/Solution.java ) | Easy | String, Dynamic_Programming, Two_Pointers | 1 | 93.01
828- | 1143 |[ Longest Common Subsequence] ( src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 33 | 46.23
828+ | 1143 |[ Longest Common Subsequence] ( src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n * m) _ Space_O(n * m) | 33 | 46.23
829829| 0072 |[ Edit Distance] ( src/main/java/g0001_0100/s0072_edit_distance/Solution.java ) | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_ Space_O(n2) | 4 | 90.13
830830
831831####Day 20
@@ -980,7 +980,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
980980
981981|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
982982|-|-|-|-|-|-
983- | 0739 |[ Daily Temperatures] ( src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java ) | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack | 10 | 94.99
983+ | 0739 |[ Daily Temperatures] ( src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java ) | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n) _ Space_O(n) | 10 | 94.99
984984| 0058 |[ Length of Last Word] ( src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java ) | Easy | String | 0 | 100.00
985985
986986####Day 7
@@ -1022,7 +1022,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
10221022
10231023|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
10241024|-|-|-|-|-|-
1025- | 0438 |[ Find All Anagrams in a String] ( src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 6 | 99.03
1025+ | 0438 |[ Find All Anagrams in a String] ( src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m) _ Space_O(1) | 6 | 99.03
10261026| 0713 |[ Subarray Product Less Than K] ( src/main/java/g0701_0800/s0713_subarray_product_less_than_k/Solution.java ) | Medium | Array, Sliding_Window | 8 | 39.00
10271027
10281028####Day 13
@@ -1354,7 +1354,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
13541354
13551355|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
13561356|-|-|-|-|-|-
1357- | 0438 |[ Find All Anagrams in a String] ( src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window | 6 | 99.03
1357+ | 0438 |[ Find All Anagrams in a String] ( src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m) _ Space_O(1) | 6 | 99.03
13581358| 0424 |[ Longest Repeating Character Replacement] ( src/main/java/g0401_0500/s0424_longest_repeating_character_replacement/Solution.java ) | Medium | String, Hash_Table, Sliding_Window | 5 | 95.15
13591359
13601360####Day 13 Hashmap
@@ -1427,8 +1427,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
14271427
14281428|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
14291429|-|-|-|-|-|-
1430- | 0543 |[ Diameter of Binary Tree] ( src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java ) | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 65.86
1431- | 0437 |[ Path Sum III] ( src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java ) | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 18 | 45.66
1430+ | 0543 |[ Diameter of Binary Tree] ( src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java ) | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n) _ Space_O(n) | 1 | 65.86
1431+ | 0437 |[ Path Sum III] ( src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java ) | Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n) _ Space_O(n) | 18 | 45.66
14321432
14331433####Day 8 Binary Search
14341434
@@ -1470,7 +1470,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
14701470
14711471|<!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
14721472|-|-|-|-|-|-
1473- | 0416 |[ Partition Equal Subset Sum] ( src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java ) | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming | 27 | 94.53
1473+ | 0416 |[ Partition Equal Subset Sum] ( src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java ) | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Big_O_Time_O(n * sums) _ Space_O(n * sums) | 27 | 94.53
14741474| 0152 |[ Maximum Product Subarray] ( src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_ Space_O(1) | 0 | 100.00
14751475
14761476####Day 14 Sliding Window/Two Pointer
@@ -1659,7 +1659,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
16591659| 0103 |[ Binary Tree Zigzag Level Order Traversal] ( src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java ) | Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 1 | 95.00
16601660| 0108 |[ Convert Sorted Array to Binary Search Tree] ( src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java ) | Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 0 | 100.00
16611661| 1008 |[ Construct Binary Search Tree from Preorder Traversal] ( src/main/java/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal/Solution.java ) | Medium | Array, Tree, Binary_Tree, Stack, Monotonic_Stack, Binary_Search_Tree | 0 | 100.00
1662- | 0543 |[ Diameter of Binary Tree] ( src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java ) | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree | 1 | 65.86
1662+ | 0543 |[ Diameter of Binary Tree] ( src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java ) | Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n) _ Space_O(n) | 1 | 65.86
16631663| 0938 |[ Range Sum of BST] ( src/main/java/g0901_1000/s0938_range_sum_of_bst/Solution.java ) | Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00
16641664| 0100 |[ Same Tree] ( src/main/java/g0001_0100/s0100_same_tree/Solution.java ) | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
16651665| 0226 |[ Invert Binary Tree] ( src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java ) | Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_ Space_O(n) | 0 | 100.00
@@ -1704,7 +1704,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.24'
17041704| 0070 |[ Climbing Stairs] ( src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_ Space_O(n) | 0 | 100.00
17051705| 0064 |[ Minimum Path Sum] ( src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java ) | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m* n)_ Space_O(m* n) | 0 | 100.00
17061706| 0300 |[ Longest Increasing Subsequence] ( src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n* log_n)_ Space_O(n) | 3 | 98.63
1707- | 1143 |[ Longest Common Subsequence] ( src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming | 33 | 46.23
1707+ | 1143 |[ Longest Common Subsequence] ( src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n * m) _ Space_O(n * m) | 33 | 46.23
17081708| 0072 |[ Edit Distance] ( src/main/java/g0001_0100/s0072_edit_distance/Solution.java ) | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_ Space_O(n2) | 4 | 90.13
17091709| 0044 |[ Wildcard Matching] ( src/main/java/g0001_0100/s0044_wildcard_matching/Solution.java ) | Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion | 2 | 99.87
17101710| 0010 |[ Regular Expression Matching] ( src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java ) | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m* n)_ Space_O(m* n) | 1 | 100.00