@@ -269,7 +269,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
269
269
270
270
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
271
271
|-|-|-|-|-|-
272
- | 0199 |[ Binary Tree Right Side View] ( src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java ) | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 92.96
272
+ | 0199 |[ Binary Tree Right Side View] ( src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java ) | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 94.57
273
273
| 0113 |[ Path Sum II] ( src/main/java/g0101_0200/s0113_path_sum_ii/Solution.java ) | Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking | 1 | 100.00
274
274
| 0450 |[ Delete Node in a BST] ( src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java ) | Medium | Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00
275
275
@@ -403,7 +403,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
403
403
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
404
404
|-|-|-|-|-|-
405
405
| 0231 |[ Power of Two] ( src/main/java/g0201_0300/s0231_power_of_two/Solution.java ) | Easy | Math, Bit_Manipulation, Recursion | 1 | 95.76
406
- | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
406
+ | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation | 1 | 84.87
407
407
408
408
#### Day 14 Bit Manipulation
409
409
@@ -456,7 +456,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
456
456
457
457
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
458
458
|-|-|-|-|-|-
459
- | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 4 | 73.02
459
+ | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
460
460
| 0547 |[ Number of Provinces] ( src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java ) | Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 1 | 94.56
461
461
462
462
#### Day 7 Breadth First Search Depth First Search
@@ -959,7 +959,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
959
959
960
960
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
961
961
|-|-|-|-|-|-
962
- | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
962
+ | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation | 1 | 84.87
963
963
| 1281 |[ Subtract the Product and Sum of Digits of an Integer] ( src/main/java/g1201_1300/s1281_subtract_the_product_and_sum_of_digits_of_an_integer/Solution.java ) | Easy | Math | 0 | 100.00
964
964
965
965
#### Day 3 Conditional Statements
@@ -1192,7 +1192,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
1192
1192
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1193
1193
|-|-|-|-|-|-
1194
1194
| 0733 |[ Flood Fill] ( src/main/java/g0701_0800/s0733_flood_fill/Solution.java ) | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
1195
- | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 4 | 73.02
1195
+ | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
1196
1196
1197
1197
#### Day 2 Matrix Related Problems
1198
1198
@@ -1306,7 +1306,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
1306
1306
|-|-|-|-|-|-
1307
1307
| 1873 |[ Calculate Special Bonus] ( src/main/java/g1801_1900/s1873_calculate_special_bonus/script.sql ) | Easy | Database | 543 | 71.60
1308
1308
| 0627 |[ Swap Salary] ( src/main/java/g0601_0700/s0627_swap_salary/script.sql ) | Easy | Database | 191 | 96.89
1309
- | 0196 |[ Delete Duplicate Emails] ( src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql ) | Easy | Database | 541 | 81.09
1309
+ | 0196 |[ Delete Duplicate Emails] ( src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql ) | Easy | Database | 903 | 48.10
1310
1310
1311
1311
#### Day 3 String Processing Functions
1312
1312
@@ -1337,7 +1337,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
1337
1337
1338
1338
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1339
1339
|-|-|-|-|-|-
1340
- | 0197 |[ Rising Temperature] ( src/main/java/g0101_0200/s0197_rising_temperature/script.sql ) | Easy | Database | 401 | 79.45
1340
+ | 0197 |[ Rising Temperature] ( src/main/java/g0101_0200/s0197_rising_temperature/script.sql ) | Easy | Database | 342 | 93.76
1341
1341
| 0607 |[ Sales Person] ( src/main/java/g0601_0700/s0607_sales_person/script.sql ) | Easy | LeetCode_Curated_SQL_70, Database | 1046 | 86.04
1342
1342
1343
1343
#### Day 7 Function
@@ -1437,7 +1437,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
1437
1437
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1438
1438
|-|-|-|-|-|-
1439
1439
| 0733 |[ Flood Fill] ( src/main/java/g0701_0800/s0733_flood_fill/Solution.java ) | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
1440
- | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 4 | 73.02
1440
+ | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
1441
1441
1442
1442
#### Day 10 Dynamic Programming
1443
1443
@@ -3126,16 +3126,16 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
3126
3126
| 0203 |[ Remove Linked List Elements] ( src/main/java/g0201_0300/s0203_remove_linked_list_elements/Solution.java ) | Easy | Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List | 1 | 90.35
3127
3127
| 0202 |[ Happy Number] ( src/main/java/g0201_0300/s0202_happy_number/Solution.java ) | Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop | 1 | 93.34
3128
3128
| 0201 |[ Bitwise AND of Numbers Range] ( src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java ) | Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation | 10 | 40.99
3129
- | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 4 | 73.02
3130
- | 0199 |[ Binary Tree Right Side View] ( src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java ) | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree | 1 | 92.96
3129
+ | 0200 |[ Number of Islands] ( src/main/java/g0101_0200/s0200_number_of_islands/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS | 3 | 97.76
3130
+ | 0199 |[ Binary Tree Right Side View] ( src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java ) | Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_16_Tree | 1 | 94.57
3131
3131
| 0198 |[ House Robber] ( src/main/java/g0101_0200/s0198_house_robber/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3 | 0 | 100.00
3132
- | 0197 |[ Rising Temperature] ( src/main/java/g0101_0200/s0197_rising_temperature/script.sql ) | Easy | Database, SQL_I_Day_6_Union | 401 | 79.45
3133
- | 0196 |[ Delete Duplicate Emails] ( src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql ) | Easy | Database, SQL_I_Day_2_Select_and_Order | 541 | 81.09
3134
- | 0195 |[ Tenth Line] ( src/main/java/g0101_0200/s0195_tenth_line/script.sh ) | Easy | Shell | 4 | 93.33
3135
- | 0194 |[ Transpose File] ( src/main/java/g0101_0200/s0194_transpose_file/script.sh ) | Medium | Shell | 0 | 100.00
3136
- | 0193 |[ Valid Phone Numbers] ( src/main/java/g0101_0200/s0193_valid_phone_numbers/script.sh ) | Easy | Shell | 129 | 42.86
3137
- | 0192 |[ Word Frequency] ( src/main/java/g0101_0200/s0192_word_frequency/script.sh ) | Medium | Shell | 152 | 38.56
3138
- | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator | 0 | 100.00
3132
+ | 0197 |[ Rising Temperature] ( src/main/java/g0101_0200/s0197_rising_temperature/script.sql ) | Easy | Database, SQL_I_Day_6_Union | 342 | 93.76
3133
+ | 0196 |[ Delete Duplicate Emails] ( src/main/java/g0101_0200/s0196_delete_duplicate_emails/script.sql ) | Easy | Database, SQL_I_Day_2_Select_and_Order | 903 | 48.10
3134
+ | 0195 |[ Tenth Line] ( src/main/java/g0101_0200/s0195_tenth_line/script.sh ) | Easy | Shell | 26 | 99.36
3135
+ | 0194 |[ Transpose File] ( src/main/java/g0101_0200/s0194_transpose_file/script.sh ) | Medium | Shell | 630 | 28.43
3136
+ | 0193 |[ Valid Phone Numbers] ( src/main/java/g0101_0200/s0193_valid_phone_numbers/script.sh ) | Easy | Shell | 112 | 75.54
3137
+ | 0192 |[ Word Frequency] ( src/main/java/g0101_0200/s0192_word_frequency/script.sh ) | Medium | Shell | 143 | 54.55
3138
+ | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator | 1 | 84.87
3139
3139
| 0190 |[ Reverse Bits] ( src/main/java/g0101_0200/s0190_reverse_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation | 1 | 98.66
3140
3140
| 0189 |[ Rotate Array] ( src/main/java/g0101_0200/s0189_rotate_array/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers | 0 | 100.00
3141
3141
| 0188 |[ Best Time to Buy and Sell Stock IV] ( src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.java ) | Hard | Array, Dynamic_Programming | 1 | 100.00
0 commit comments