@@ -599,7 +599,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.45'
599599
600600| <!--  -->   | <!--  -->   | <!--  -->   | <!--  -->   | <!--  -->   | <!--  --> 
601601|-|-|-|-|-|-
602- | 0014 |[ Longest Common Prefix] ( src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java ) | Easy | Top_Interview_Questions, String | 0 | 100.00
602+ | 0014 |[ Longest Common Prefix] ( src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java ) | Easy | Top_Interview_Questions, String, Big_O_Time_O(n \* m) _ Space_O(m)  | 0 | 100.00
603603| 0043 |[ Multiply Strings] ( src/main/java/g0001_0100/s0043_multiply_strings/Solution.java ) | Medium | String, Math, Simulation | 1 | 100.00
604604
605605#### Day 3 Linked List  
@@ -740,8 +740,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.45'
740740|-|-|-|-|-|-
741741| 0412 |[ Fizz Buzz] ( src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java ) | Easy | String, Math, Simulation | 1 | 100.00
742742| 0136 |[ Single Number] ( src/main/java/g0101_0200/s0136_single_number/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_ Space_O(1) | 1 | 99.86
743- | 0007 |[ Reverse Integer] ( src/main/java/g0001_0100/s0007_reverse_integer/Solution.java ) | Medium | Top_Interview_Questions, Math | 0 | 100.00
744- | 0009 |[ Palindrome Number] ( src/main/java/g0001_0100/s0009_palindrome_number/Solution.java ) | Easy | Math | 4 | 100.00
743+ | 0007 |[ Reverse Integer] ( src/main/java/g0001_0100/s0007_reverse_integer/Solution.java ) | Medium | Top_Interview_Questions, Math, Big_O_Time_O(log10(x)) _ Space_O(1)  | 0 | 100.00
744+ | 0009 |[ Palindrome Number] ( src/main/java/g0001_0100/s0009_palindrome_number/Solution.java ) | Easy | Math, Big_O_Time_O(log10(x)) _ Space_O(1)  | 4 | 100.00
745745| 0172 |[ Factorial Trailing Zeroes] ( src/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java ) | Medium | Top_Interview_Questions, Math | 0 | 100.00
746746| 0050 |[ Pow(x, n)] ( src/main/java/g0001_0100/s0050_powx_n/Solution.java ) | Medium | Top_Interview_Questions, Math, Recursion | 0 | 100.00
747747
@@ -750,7 +750,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.45'
750750| <!--  -->   | <!--  -->   | <!--  -->   | <!--  -->   | <!--  -->   | <!--  --> 
751751|-|-|-|-|-|-
752752| 0344 |[ Reverse String] ( src/main/java/g0301_0400/s0344_reverse_string/Solution.java ) | Easy | String, Two_Pointers, Recursion | 1 | 99.91
753- | 0014 |[ Longest Common Prefix] ( src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java ) | Easy | Top_Interview_Questions, String | 0 | 100.00
753+ | 0014 |[ Longest Common Prefix] ( src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java ) | Easy | Top_Interview_Questions, String, Big_O_Time_O(n \* m) _ Space_O(m)  | 0 | 100.00
754754| 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
755755| 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), AI_can_be_used_to_solve_the_task | 2 | 98.59
756756| 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 | 97.19
@@ -968,12 +968,12 @@ implementation 'com.github.javadev:leetcode-in-java:1.45'
968968| 0134 |[ Gas Station] ( src/main/java/g0101_0200/s0134_gas_station/Solution.java ) | Medium | Top_Interview_Questions, Array, Greedy | 2 | 97.52
969969| 0135 |[ Candy] ( src/main/java/g0101_0200/s0135_candy/Solution.java ) | Hard | Array, Greedy | 3 | 83.95
970970| 0042 |[ Trapping Rain Water] ( src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java ) | Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_ Space_O(1) | 0 | 100.00
971- | 0013 |[ Roman to Integer] ( src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java ) | Easy | Top_Interview_Questions, String, Hash_Table, Math | 2 | 100.00
972- | 0012 |[ Integer to Roman] ( src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java ) | Medium | String, Hash_Table, Math | 2 | 100.00
971+ | 0013 |[ Roman to Integer] ( src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java ) | Easy | Top_Interview_Questions, String, Hash_Table, Math, Big_O_Time_O(n) _ Space_O(1)  | 2 | 100.00
972+ | 0012 |[ Integer to Roman] ( src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java ) | Medium | String, Hash_Table, Math, Big_O_Time_O(1) _ Space_O(1)  | 2 | 100.00
973973| 0058 |[ Length of Last Word] ( src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java ) | Easy | String | 0 | 100.00
974- | 0014 |[ Longest Common Prefix] ( src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java ) | Easy | Top_Interview_Questions, String | 0 | 100.00
974+ | 0014 |[ Longest Common Prefix] ( src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java ) | Easy | Top_Interview_Questions, String, Big_O_Time_O(n \* m) _ Space_O(m)  | 0 | 100.00
975975| 0151 |[ Reverse Words in a String] ( src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java ) | Medium | String, Two_Pointers, LeetCode_75_Array/String | 2 | 99.69
976- | 0006 |[ Zigzag Conversion] ( src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java ) | Medium | String | 2 | 99.71
976+ | 0006 |[ Zigzag Conversion] ( src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java ) | Medium | String, Big_O_Time_O(n) _ Space_O(n)  | 2 | 99.71
977977| 0028 |[ Implement strStr()] ( src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java ) | Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching | 0 | 100.00
978978| 0068 |[ Text Justification] ( src/main/java/g0001_0100/s0068_text_justification/Solution.java ) | Hard | Array, String, Simulation | 0 | 100.00
979979
@@ -1182,7 +1182,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.45'
11821182
11831183| <!--  -->   | <!--  -->   | <!--  -->   | <!--  -->   | <!--  -->   | <!--  --> 
11841184|-|-|-|-|-|-
1185- | 0009 |[ Palindrome Number] ( src/main/java/g0001_0100/s0009_palindrome_number/Solution.java ) | Easy | Math | 4 | 100.00
1185+ | 0009 |[ Palindrome Number] ( src/main/java/g0001_0100/s0009_palindrome_number/Solution.java ) | Easy | Math, Big_O_Time_O(log10(x)) _ Space_O(1)  | 4 | 100.00
11861186| 0066 |[ Plus One] ( src/main/java/g0001_0100/s0066_plus_one/Solution.java ) | Easy | Top_Interview_Questions, Array, Math | 0 | 100.00
11871187| 0172 |[ Factorial Trailing Zeroes] ( src/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java ) | Medium | Top_Interview_Questions, Math | 0 | 100.00
11881188| 0069 |[ Sqrt(x)] ( src/main/java/g0001_0100/s0069_sqrtx/Solution.java ) | Easy | Top_Interview_Questions, Math, Binary_Search | 1 | 86.67
0 commit comments