@@ -311,7 +311,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
311311
312312| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
313313|-|-|-|-|-|-
314- | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 97.94
314+ | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 96.96
315315| 0516 |[ Longest Palindromic Subsequence] ( src/main/java/g0501_0600/s0516_longest_palindromic_subsequence/Solution.java ) | Medium | String, Dynamic_Programming | 88 | 58.87
316316
317317#### Day 18
@@ -862,7 +862,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
862862
863863| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
864864|-|-|-|-|-|-
865- | 0001 |[ Two Sum] ( src/main/java/g0001_0100/s0001_two_sum/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_ Space_O(n) | 1 | 99.37
865+ | 0001 |[ Two Sum] ( src/main/java/g0001_0100/s0001_two_sum/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_ Space_O(n) | 2 | 85.97
866866| 0299 |[ Bulls and Cows] ( src/main/java/g0201_0300/s0299_bulls_and_cows/Solution.java ) | Medium | String, Hash_Table, Counting | 6 | 86.69
867867
868868#### Day 14 Stack
@@ -978,7 +978,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
978978
979979| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
980980|-|-|-|-|-|-
981- | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_ Space_O(1) | 2 | 99.88
981+ | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_ Space_O(1) | 2 | 99.52
982982| 0016 |[ 3Sum Closest] ( src/main/java/g0001_0100/s0016_3sum_closest/Solution.java ) | Medium | Array, Sorting, Two_Pointers | 3 | 99.88
983983| 0076 |[ Minimum Window Substring] ( src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java ) | Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_ Space_O(1) | 2 | 99.94
984984
@@ -1034,8 +1034,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
10341034|-|-|-|-|-|-
10351035| 0412 |[ Fizz Buzz] ( src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java ) | Easy | Top_Interview_Questions, String, Math, Simulation | 1 | 100.00
10361036| 0136 |[ Single Number] ( src/main/java/g0101_0200/s0136_single_number/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_ Space_O(1) | 1 | 99.97
1037- | 0007 |[ Reverse Integer] ( src/main/java/g0001_0100/s0007_reverse_integer/Solution.java ) | Medium | Top_Interview_Questions, Math | 1 | 99.69
1038- | 0009 |[ Palindrome Number] ( src/main/java/g0001_0100/s0009_palindrome_number/Solution.java ) | Easy | Math | 4 | 100.00
1037+ | 0007 |[ Reverse Integer] ( src/main/java/g0001_0100/s0007_reverse_integer/Solution.java ) | Medium | Top_Interview_Questions, Math | 1 | 96.61
1038+ | 0009 |[ Palindrome Number] ( src/main/java/g0001_0100/s0009_palindrome_number/Solution.java ) | Easy | Math | 5 | 77.91
10391039| 0172 |[ Factorial Trailing Zeroes] ( src/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java ) | Medium | Top_Interview_Questions, Math | 1 | 85.61
10401040| 0050 |[ Pow(x, n)] ( src/main/java/g0001_0100/s0050_powx_n/Solution.java ) | Medium | Top_Interview_Questions, Math, Recursion | 0 | 100.00
10411041
@@ -1046,9 +1046,9 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
10461046| 0344 |[ Reverse String] ( src/main/java/g0301_0400/s0344_reverse_string/Solution.java ) | Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 1 | 99.91
10471047| 0014 |[ Longest Common Prefix] ( src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java ) | Easy | Top_Interview_Questions, String | 0 | 100.00
10481048| 0187 |[ Repeated DNA Sequences] ( src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java ) | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 29 | 77.11
1049- | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_ Space_O(1) | 2 | 99.88
1049+ | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_ Space_O(1) | 2 | 99.52
10501050| 0020 |[ Valid Parentheses] ( src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_ Space_O(n) | 2 | 90.49
1051- | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 97.94
1051+ | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 96.96
10521052| 0394 |[ Decode String] ( src/main/java/g0301_0400/s0394_decode_string/Solution.java ) | Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_ Space_O(n) | 1 | 87.68
10531053| 0242 |[ Valid Anagram] ( src/main/java/g0201_0300/s0242_valid_anagram/Solution.java ) | Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 2 | 99.01
10541054| 0049 |[ Group Anagrams] ( src/main/java/g0001_0100/s0049_group_anagrams/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\* k_log_k)_ Space_O(n) | 6 | 92.28
@@ -1069,7 +1069,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
10691069|-|-|-|-|-|-
10701070| 0121 |[ Best Time to Buy and Sell Stock] ( src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_ Space_O(1) | 1 | 100.00
10711071| 0283 |[ Move Zeroes] ( src/main/java/g0201_0300/s0283_move_zeroes/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_ Space_O(1) | 2 | 79.54
1072- | 0001 |[ Two Sum] ( src/main/java/g0001_0100/s0001_two_sum/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_ Space_O(n) | 1 | 99.37
1072+ | 0001 |[ Two Sum] ( src/main/java/g0001_0100/s0001_two_sum/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_ Space_O(n) | 2 | 85.97
10731073| 0217 |[ Contains Duplicate] ( src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java ) | Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 6 | 96.68
10741074| 0058 |[ Length of Last Word] ( src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java ) | Easy | String | 0 | 100.00
10751075| 0605 |[ Can Place Flowers] ( src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java ) | Easy | Array, Greedy | 1 | 96.77
@@ -1253,7 +1253,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
12531253
12541254| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12551255|-|-|-|-|-|-
1256- | 0001 |[ Two Sum] ( src/main/java/g0001_0100/s0001_two_sum/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_ Space_O(n) | 1 | 99.37
1256+ | 0001 |[ Two Sum] ( src/main/java/g0001_0100/s0001_two_sum/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_ Space_O(n) | 2 | 85.97
12571257| 0088 |[ Merge Sorted Array] ( src/main/java/g0001_0100/s0088_merge_sorted_array/Solution.java ) | Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 0 | 100.00
12581258
12591259#### Day 3 Array
@@ -1412,7 +1412,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
14121412| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
14131413|-|-|-|-|-|-
14141414| 0187 |[ Repeated DNA Sequences] ( src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java ) | Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 29 | 77.11
1415- | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 97.94
1415+ | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 96.96
14161416
14171417#### Day 10 Linked List
14181418
@@ -1544,7 +1544,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
15441544
15451545| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
15461546|-|-|-|-|-|-
1547- | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_ Space_O(1) | 2 | 99.88
1547+ | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_ Space_O(1) | 2 | 99.52
15481548| 0567 |[ Permutation in String] ( src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java ) | Medium | String, Hash_Table, Two_Pointers, Sliding_Window | 5 | 93.93
15491549
15501550#### Day 7 Breadth First Search Depth First Search
@@ -1708,7 +1708,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.27'
17081708
17091709| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
17101710|-|-|-|-|-|-
1711- | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 97.94
1711+ | 0005 |[ Longest Palindromic Substring] ( src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 7 | 96.96
17121712| 0413 |[ Arithmetic Slices] ( src/main/java/g0401_0500/s0413_arithmetic_slices/Solution.java ) | Medium | Array, Dynamic_Programming | 0 | 100.00
17131713
17141714#### Day 15 Dynamic Programming
0 commit comments