diff --git a/README.md b/README.md index b98e81333..bbf7f5d1f 100644 --- a/README.md +++ b/README.md @@ -57,7 +57,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 261 | 77.91 -| 0374 |[Guess Number Higher or Lower](src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt)| Easy | Binary_Search, Interactive | 134 | 94.19 +| 0374 |[Guess Number Higher or Lower](src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt)| Easy | Binary_Search, Interactive, LeetCode_75_Binary_Search | 134 | 94.19 #### Day 2 @@ -162,7 +162,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0875 |[Koko Eating Bananas](src/main/kotlin/g0801_0900/s0875_koko_eating_bananas/Solution.kt)| Medium | Array, Binary_Search | 267 | 93.85 +| 0875 |[Koko Eating Bananas](src/main/kotlin/g0801_0900/s0875_koko_eating_bananas/Solution.kt)| Medium | Array, Binary_Search, LeetCode_75_Binary_Search | 267 | 93.85 | 1552 |[Magnetic Force Between Two Balls](src/main/kotlin/g1501_1600/s1552_magnetic_force_between_two_balls/Solution.kt)| Medium | Array, Sorting, Binary_Search | 636 | 100.00 #### Day 5 @@ -219,7 +219,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0081 |[Search in Rotated Sorted Array II](src/main/kotlin/g0001_0100/s0081_search_in_rotated_sorted_array_ii/Solution.kt)| Medium | Array, Binary_Search | 170 | 96.30 -| 0162 |[Find Peak Element](src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt)| Medium | Top_Interview_Questions, Array, Binary_Search | 297 | 53.85 +| 0162 |[Find Peak Element](src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 297 | 53.85 #### Day 13 @@ -284,20 +284,20 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0509 |[Fibonacci Number](src/main/kotlin/g0501_0600/s0509_fibonacci_number/Solution.kt)| Easy | Dynamic_Programming, Math, Recursion, Memoization | 139 | 82.72 -| 1137 |[N-th Tribonacci Number](src/main/kotlin/g1101_1200/s1137_n_th_tribonacci_number/Solution.kt)| Easy | Dynamic_Programming, Math, Memoization | 122 | 69.35 +| 1137 |[N-th Tribonacci Number](src/main/kotlin/g1101_1200/s1137_n_th_tribonacci_number/Solution.kt)| Easy | Dynamic_Programming, Math, Memoization, LeetCode_75_DP/1D | 122 | 69.35 #### Day 2 | | | | | | |-|-|-|-|-|- | 0070 |[Climbing Stairs](src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 124 | 71.98 -| 0746 |[Min Cost Climbing Stairs](src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt)| Easy | Array, Dynamic_Programming | 171 | 96.76 +| 0746 |[Min Cost Climbing Stairs](src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt)| Easy | Array, Dynamic_Programming, LeetCode_75_DP/1D | 171 | 96.76 #### Day 3 | | | | | | |-|-|-|-|-|- -| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 +| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 | 0213 |[House Robber II](src/main/kotlin/g0201_0300/s0213_house_robber_ii/Solution.kt)| Medium | Array, Dynamic_Programming | 257 | 59.62 | 0740 |[Delete and Earn](src/main/kotlin/g0701_0800/s0740_delete_and_earn/Solution.kt)| Medium | Array, Hash_Table, Dynamic_Programming | 192 | 100.00 @@ -335,7 +335,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0309 |[Best Time to Buy and Sell Stock with Cooldown](src/main/kotlin/g0301_0400/s0309_best_time_to_buy_and_sell_stock_with_cooldown/Solution.kt)| Medium | Array, Dynamic_Programming | 272 | 73.33 -| 0714 |[Best Time to Buy and Sell Stock with Transaction Fee](src/main/kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt)| Medium | Array, Dynamic_Programming, Greedy | 417 | 90.91 +| 0714 |[Best Time to Buy and Sell Stock with Transaction Fee](src/main/kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt)| Medium | Array, Dynamic_Programming, Greedy, LeetCode_75_DP/Multidimensional | 417 | 90.91 #### Day 9 @@ -383,7 +383,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0062 |[Unique Paths](src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 118 | 94.65 +| 0062 |[Unique Paths](src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 118 | 94.65 | 0063 |[Unique Paths II](src/main/kotlin/g0001_0100/s0063_unique_paths_ii/Solution.kt)| Medium | Array, Dynamic_Programming, Matrix | 151 | 81.94 #### Day 16 @@ -411,9 +411,9 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers | 156 | 87.74 -| 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36 -| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 +| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 156 | 87.74 +| 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36 +| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 #### Day 20 @@ -475,7 +475,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 1588 |[Sum of All Odd Length Subarrays](src/main/kotlin/g1501_1600/s1588_sum_of_all_odd_length_subarrays/Solution.kt)| Easy | Array, Math, Prefix_Sum | 157 | 64.00 -| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07 +| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07 | 1672 |[Richest Customer Wealth](src/main/kotlin/g1601_1700/s1672_richest_customer_wealth/Solution.kt)| Easy | Array, Matrix | 155 | 94.54 #### Day 7 Array @@ -489,7 +489,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 1768 |[Merge Strings Alternately](src/main/kotlin/g1701_1800/s1768_merge_strings_alternately/Solution.kt)| Easy | String, Two_Pointers | 138 | 93.81 +| 1768 |[Merge Strings Alternately](src/main/kotlin/g1701_1800/s1768_merge_strings_alternately/Solution.kt)| Easy | String, Two_Pointers, LeetCode_75_Array/String | 138 | 93.81 | 1678 |[Goal Parser Interpretation](src/main/kotlin/g1601_1700/s1678_goal_parser_interpretation/Solution.kt)| Easy | String | 136 | 88.24 | 0389 |[Find the Difference](src/main/kotlin/g0301_0400/s0389_find_the_difference/Solution.kt)| Easy | String, Hash_Table, Sorting, Bit_Manipulation | 256 | 64.81 @@ -507,7 +507,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 1290 |[Convert Binary Number in a Linked List to Integer](src/main/kotlin/g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer/Solution.kt)| Easy | Math, Linked_List | 138 | 65.79 | 0876 |[Middle of the Linked List](src/main/kotlin/g0801_0900/s0876_middle_of_the_linked_list/Solution.kt)| Easy | Two_Pointers, Linked_List | 136 | 76.52 -| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 +| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 | 0404 |[Sum of Left Leaves](src/main/kotlin/g0401_0500/s0404_sum_of_left_leaves/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 173 | 86.05 #### Day 11 Containers and Libraries @@ -567,7 +567,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0739 |[Daily Temperatures](src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 936 | 80.54 +| 0739 |[Daily Temperatures](src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 936 | 80.54 | 0058 |[Length of Last Word](src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt)| Easy | String | 135 | 93.67 #### Day 7 @@ -711,20 +711,20 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0934 |[Shortest Bridge](src/main/kotlin/g0901_1000/s0934_shortest_bridge/Solution.kt)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 301 | 80.95 -| 1926 |[Nearest Exit from Entrance in Maze](src/main/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.kt)| Medium | Array, Breadth_First_Search, Matrix | 351 | 94.44 +| 1926 |[Nearest Exit from Entrance in Maze](src/main/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.kt)| Medium | Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 351 | 94.44 #### Day 7 Standard Traversal | | | | | | |-|-|-|-|-|- | 0797 |[All Paths From Source to Target](src/main/kotlin/g0701_0800/s0797_all_paths_from_source_to_target/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking | 232 | 100.00 -| 0841 |[Keys and Rooms](src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 189 | 69.23 +| 0841 |[Keys and Rooms](src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 189 | 69.23 #### Day 8 Standard Traversal | | | | | | |-|-|-|-|-|- -| 0547 |[Number of Provinces](src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 229 | 79.73 +| 0547 |[Number of Provinces](src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 229 | 79.73 | 1319 |[Number of Operations to Make Network Connected](src/main/kotlin/g1301_1400/s1319_number_of_operations_to_make_network_connected/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 379 | 83.33 #### Day 9 Standard Traversal @@ -739,7 +739,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 1129 |[Shortest Path with Alternating Colors](src/main/kotlin/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.kt)| Medium | Breadth_First_Search, Graph | 208 | 80.00 -| 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](src/main/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 718 | 100.00 +| 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](src/main/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 718 | 100.00 | 0847 |[Shortest Path Visiting All Nodes](src/main/kotlin/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.kt)| Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask | 164 | 100.00 #### Day 11 Breadth First Search @@ -865,21 +865,21 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 1480 |[Running Sum of 1d Array](src/main/kotlin/g1401_1500/s1480_running_sum_of_1d_array/Solution.kt)| Easy | Array, Prefix_Sum | 161 | 84.80 -| 0724 |[Find Pivot Index](src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt)| Easy | Array, Prefix_Sum | 255 | 88.92 +| 0724 |[Find Pivot Index](src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt)| Easy | Array, Prefix_Sum, LeetCode_75_Prefix_Sum | 255 | 88.92 #### Day 2 String | | | | | | |-|-|-|-|-|- | 0205 |[Isomorphic Strings](src/main/kotlin/g0201_0300/s0205_isomorphic_strings/Solution.kt)| Easy | String, Hash_Table | 278 | 79.96 -| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers | 156 | 87.74 +| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 156 | 87.74 #### Day 3 Linked List | | | | | | |-|-|-|-|-|- | 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24 -| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 +| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 #### Day 4 Linked List @@ -934,8 +934,8 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0746 |[Min Cost Climbing Stairs](src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt)| Easy | Array, Dynamic_Programming | 171 | 96.76 -| 0062 |[Unique Paths](src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 118 | 94.65 +| 0746 |[Min Cost Climbing Stairs](src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt)| Easy | Array, Dynamic_Programming, LeetCode_75_DP/1D | 171 | 96.76 +| 0062 |[Unique Paths](src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 118 | 94.65 #### Day 12 Sliding Window/Two Pointer @@ -956,7 +956,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0844 |[Backspace String Compare](src/main/kotlin/g0801_0900/s0844_backspace_string_compare/Solution.kt)| Easy | String, Two_Pointers, Stack, Simulation | 126 | 98.31 -| 0394 |[Decode String](src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 224 | 64.86 +| 0394 |[Decode String](src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 224 | 64.86 #### Day 15 Heap @@ -993,7 +993,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Linked_List | 216 | 86.96 +| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Linked_List, LeetCode_75_LinkedList | 216 | 86.96 | 0148 |[Sort List](src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 820 | 61.70 #### Day 5 Greedy @@ -1015,7 +1015,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0543 |[Diameter of Binary Tree](src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 307 | 43.93 -| 0437 |[Path Sum III](src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 403 | 54.12 +| 0437 |[Path Sum III](src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 403 | 54.12 #### Day 8 Binary Search @@ -1036,7 +1036,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix | 164 | 82.95 +| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 164 | 82.95 | 0417 |[Pacific Atlantic Water Flow](src/main/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.kt)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 319 | 100.00 #### Day 11 Graph/BFS/DFS @@ -1050,7 +1050,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 +| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 | 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68 #### Day 13 Dynamic Programming @@ -1074,7 +1074,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 0100 |[Same Tree](src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 134 | 86.63 | 0101 |[Symmetric Tree](src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35 -| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 +| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 194 | 92.89 #### Day 16 Design @@ -1082,7 +1082,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 0232 |[Implement Queue using Stacks](src/main/kotlin/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.kt)| Easy | Stack, Design, Queue | 258 | 70.86 | 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88 -| 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 +| 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 #### Day 17 Interval @@ -1095,14 +1095,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0735 |[Asteroid Collision](src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt)| Medium | Array, Stack | 243 | 100.00 +| 0735 |[Asteroid Collision](src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt)| Medium | Array, Stack, LeetCode_75_Stack | 243 | 100.00 | 0227 |[Basic Calculator II](src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt)| Medium | String, Math, Stack | 383 | 62.50 #### Day 19 Union Find | | | | | | |-|-|-|-|-|- -| 0547 |[Number of Provinces](src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 229 | 79.73 +| 0547 |[Number of Provinces](src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 229 | 79.73 | 0947 |[Most Stones Removed with Same Row or Column](src/main/kotlin/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.kt)| Medium | Depth_First_Search, Graph, Union_Find | 200 | 100.00 #### Day 20 Brute Force/Backtracking @@ -1119,7 +1119,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0412 |[Fizz Buzz](src/main/kotlin/g0401_0500/s0412_fizz_buzz/Solution.kt)| Easy | String, Math, Simulation | 307 | 71.81 -| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 +| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 | 0007 |[Reverse Integer](src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt)| Medium | Top_Interview_Questions, Math | 149 | 77.89 | 0009 |[Palindrome Number](src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt)| Easy | Math | 217 | 95.34 | 0172 |[Factorial Trailing Zeroes](src/main/kotlin/g0101_0200/s0172_factorial_trailing_zeroes/Solution.kt)| Medium | Top_Interview_Questions, Math | 220 | 67.65 @@ -1135,10 +1135,10 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0003 |[Longest Substring Without Repeating Characters](src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt)| 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 | 201 | 87.28 | 0020 |[Valid Parentheses](src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 137 | 88.76 | 0005 |[Longest Palindromic Substring](src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 162 | 99.00 -| 0394 |[Decode String](src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 224 | 64.86 +| 0394 |[Decode String](src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 224 | 64.86 | 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | String, Hash_Table, Sorting | 251 | 87.65 | 0049 |[Group Anagrams](src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 308 | 96.34 -| 0151 |[Reverse Words in a String](src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt)| Medium | String, Two_Pointers | 206 | 98.90 +| 0151 |[Reverse Words in a String](src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt)| Medium | String, Two_Pointers, LeetCode_75_Array/String | 206 | 98.90 | 0273 |[Integer to English Words](src/main/kotlin/g0201_0300/s0273_integer_to_english_words/Solution.kt)| Hard | String, Math, Recursion | 273 | 82.93 #### Udemy Binary Search @@ -1154,18 +1154,18 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0121 |[Best Time to Buy and Sell Stock](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 609 | 94.06 -| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07 +| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07 | 0001 |[Two Sum](src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 202 | 91.18 | 0217 |[Contains Duplicate](src/main/kotlin/g0201_0300/s0217_contains_duplicate/Solution.kt)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49 | 0058 |[Length of Last Word](src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt)| Easy | String | 135 | 93.67 -| 0605 |[Can Place Flowers](src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt)| Easy | Array, Greedy | 209 | 85.71 +| 0605 |[Can Place Flowers](src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt)| Easy | Array, Greedy, LeetCode_75_Array/String | 209 | 85.71 | 0122 |[Best Time to Buy and Sell Stock II](src/main/kotlin/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.kt)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 197 | 95.10 | 0080 |[Remove Duplicates from Sorted Array II](src/main/kotlin/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.kt)| Medium | Array, Two_Pointers | 192 | 80.67 | 0189 |[Rotate Array](src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 483 | 86.95 | 0055 |[Jump Game](src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 332 | 89.35 | 0075 |[Sort Colors](src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 164 | 64.43 | 0066 |[Plus One](src/main/kotlin/g0001_0100/s0066_plus_one/Solution.kt)| Easy | Top_Interview_Questions, Array, Math | 148 | 98.75 -| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 +| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 | 1291 |[Sequential Digits](src/main/kotlin/g1201_1300/s1291_sequential_digits/Solution.kt)| Medium | Enumeration | 114 | 100.00 | 0448 |[Find All Numbers Disappeared in an Array](src/main/kotlin/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.kt)| Easy | Array, Hash_Table | 394 | 100.00 | 0442 |[Find All Duplicates in an Array](src/main/kotlin/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.kt)| Medium | Array, Hash_Table | 480 | 73.81 @@ -1182,7 +1182,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers | 156 | 87.74 +| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 156 | 87.74 | 0125 |[Valid Palindrome](src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers | 353 | 52.06 | 0977 |[Squares of a Sorted Array](src/main/kotlin/g0901_1000/s0977_squares_of_a_sorted_array/Solution.kt)| Easy | Array, Sorting, Two_Pointers | 271 | 77.17 | 0026 |[Remove Duplicates from Sorted Array](src/main/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.kt)| Easy | Top_Interview_Questions, Array, Two_Pointers | 249 | 67.38 @@ -1220,13 +1220,13 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 0114 |[Flatten Binary Tree to Linked List](src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 191 | 93.10 | 0445 |[Add Two Numbers II](src/main/kotlin/g0401_0500/s0445_add_two_numbers_ii/Solution.kt)| Medium | Math, Stack, Linked_List | 240 | 82.61 -| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Linked_List | 216 | 86.96 +| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Linked_List, LeetCode_75_LinkedList | 216 | 86.96 | 0061 |[Rotate List](src/main/kotlin/g0001_0100/s0061_rotate_list/Solution.kt)| Medium | Two_Pointers, Linked_List | 160 | 92.22 | 0024 |[Swap Nodes in Pairs](src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 149 | 44.20 | 0876 |[Middle of the Linked List](src/main/kotlin/g0801_0900/s0876_middle_of_the_linked_list/Solution.kt)| Easy | Two_Pointers, Linked_List | 136 | 76.52 | 0142 |[Linked List Cycle II](src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 192 | 63.39 | 0141 |[Linked List Cycle](src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 223 | 91.85 -| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 +| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 | 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24 | 0160 |[Intersection of Two Linked Lists](src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 262 | 83.50 | 0234 |[Palindrome Linked List](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 641 | 79.53 @@ -1251,21 +1251,21 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0100 |[Same Tree](src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 134 | 86.63 | 0226 |[Invert Binary Tree](src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 233 | 54.90 | 0111 |[Minimum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 525 | 90.51 -| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 +| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 | 0110 |[Balanced Binary Tree](src/main/kotlin/g0101_0200/s0110_balanced_binary_tree/Solution.kt)| Easy | Depth_First_Search, Tree, Binary_Tree | 182 | 71.30 | 0701 |[Insert into a Binary Search Tree](src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 311 | 79.03 | 0297 |[Serialize and Deserialize Binary Tree](src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt)| Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85 | 0124 |[Binary Tree Maximum Path Sum](src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 331 | 74.42 | 0098 |[Validate Binary Search Tree](src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 190 | 61.62 | 0337 |[House Robber III](src/main/kotlin/g0301_0400/s0337_house_robber_iii/Solution.kt)| Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 282 | 84.62 -| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 | 0968 |[Binary Tree Cameras](src/main/kotlin/g0901_1000/s0968_binary_tree_cameras/Solution.kt)| Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 176 | 100.00 #### Udemy Trie and Heap | | | | | | |-|-|-|-|-|- -| 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 +| 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 | 0745 |[Prefix and Suffix Search](src/main/kotlin/g0701_0800/s0745_prefix_and_suffix_search/WordFilter.kt)| Hard | String, Design, Trie | 1638 | 100.00 #### Udemy Graph @@ -1285,14 +1285,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0119 |[Pascal's Triangle II](src/main/kotlin/g0101_0200/s0119_pascals_triangle_ii/Solution.kt)| Easy | Array, Dynamic_Programming | 157 | 97.27 | 0139 |[Word Break](src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 197 | 87.17 | 0152 |[Maximum Product Subarray](src/main/kotlin/g0101_0200/s0152_maximum_product_subarray/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 253 | 88.42 -| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 +| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 | 0213 |[House Robber II](src/main/kotlin/g0201_0300/s0213_house_robber_ii/Solution.kt)| Medium | Array, Dynamic_Programming | 257 | 59.62 | 0509 |[Fibonacci Number](src/main/kotlin/g0501_0600/s0509_fibonacci_number/Solution.kt)| Easy | Dynamic_Programming, Math, Recursion, Memoization | 139 | 82.72 | 0070 |[Climbing Stairs](src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 124 | 71.98 | 0064 |[Minimum Path Sum](src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 164 | 100.00 | 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28 -| 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36 -| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 +| 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36 +| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 | 0044 |[Wildcard Matching](src/main/kotlin/g0001_0100/s0044_wildcard_matching/Solution.kt)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion | 220 | 84.85 | 0010 |[Regular Expression Matching](src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 171 | 85.26 @@ -1302,9 +1302,9 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 0022 |[Generate Parentheses](src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 161 | 85.45 | 0039 |[Combination Sum](src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 226 | 88.89 -| 0216 |[Combination Sum III](src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt)| Medium | Array, Backtracking | 175 | 90.91 +| 0216 |[Combination Sum III](src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt)| Medium | Array, Backtracking, LeetCode_75_Backtracking | 175 | 90.91 | 0078 |[Subsets](src/main/kotlin/g0001_0100/s0078_subsets/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 171 | 94.92 -| 0017 |[Letter Combinations of a Phone Number](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 +| 0017 |[Letter Combinations of a Phone Number](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 | 0046 |[Permutations](src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 188 | 99.00 #### Udemy Bit Manipulation @@ -1316,7 +1316,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0190 |[Reverse Bits](src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 198 | 81.82 | 0461 |[Hamming Distance](src/main/kotlin/g0401_0500/s0461_hamming_distance/Solution.kt)| Easy | Bit_Manipulation | 150 | 96.15 | 1009 |[Complement of Base 10 Integer](src/main/kotlin/g1001_1100/s1009_complement_of_base_10_integer/Solution.kt)| Easy | Bit_Manipulation | 126 | 72.73 -| 0338 |[Counting Bits](src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt)| Easy | Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 186 | 99.26 +| 0338 |[Counting Bits](src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 186 | 99.26 | 0371 |[Sum of Two Integers](src/main/kotlin/g0301_0400/s0371_sum_of_two_integers/Solution.kt)| Medium | Math, Bit_Manipulation | 129 | 95.45 | 0029 |[Divide Two Integers](src/main/kotlin/g0001_0100/s0029_divide_two_integers/Solution.kt)| Medium | Top_Interview_Questions, Math, Bit_Manipulation | 144 | 82.50 @@ -1344,7 +1344,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0045 |[Jump Game II](src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 208 | 93.37 | 0274 |[H-Index](src/main/kotlin/g0201_0300/s0274_h_index/Solution.kt)| Medium | Array, Sorting, Counting_Sort | 291 | 45.45 | 0380 |[Insert Delete GetRandom O(1)](src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.kt)| Medium | Array, Hash_Table, Math, Design, Randomized | 1326 | 68.23 -| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 +| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 | 0134 |[Gas Station](src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt)| Medium | Top_Interview_Questions, Array, Greedy | 545 | 70.18 | 0135 |[Candy](src/main/kotlin/g0101_0200/s0135_candy/Solution.kt)| Hard | Array, Greedy | 466 | 58.33 | 0042 |[Trapping Rain Water](src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 189 | 99.37 @@ -1352,7 +1352,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0012 |[Integer to Roman](src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt)| Medium | String, Hash_Table, Math | 180 | 98.25 | 0058 |[Length of Last Word](src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt)| Easy | String | 135 | 93.67 | 0014 |[Longest Common Prefix](src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String | 154 | 89.70 -| 0151 |[Reverse Words in a String](src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt)| Medium | String, Two_Pointers | 206 | 98.90 +| 0151 |[Reverse Words in a String](src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt)| Medium | String, Two_Pointers, LeetCode_75_Array/String | 206 | 98.90 | 0006 |[Zigzag Conversion](src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt)| Medium | String | 200 | 97.79 | 0028 |[Find the Index of the First Occurrence in a String](src/main/kotlin/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching | 126 | 97.58 | 0068 |[Text Justification](src/main/kotlin/g0001_0100/s0068_text_justification/Solution.kt)| Hard | Array, String, Simulation | 153 | 92.96 @@ -1362,9 +1362,9 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0125 |[Valid Palindrome](src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers | 353 | 52.06 -| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers | 156 | 87.74 +| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 156 | 87.74 | 0167 |[Two Sum II - Input Array Is Sorted](src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt)| Medium | Array, Binary_Search, Two_Pointers | 403 | 68.74 -| 0011 |[Container With Most Water](src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 402 | 78.57 +| 0011 |[Container With Most Water](src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 402 | 78.57 | 0015 |[3Sum](src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 493 | 93.45 #### Top Interview 150 Sliding Window @@ -1407,7 +1407,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0228 |[Summary Ranges](src/main/kotlin/g0201_0300/s0228_summary_ranges/Solution.kt)| Easy | Array | 169 | 91.89 | 0056 |[Merge Intervals](src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 334 | 80.67 | 0057 |[Insert Interval](src/main/kotlin/g0001_0100/s0057_insert_interval/Solution.kt)| Medium | Array | 249 | 75.63 -| 0452 |[Minimum Number of Arrows to Burst Balloons](src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt)| Medium | Array, Sorting, Greedy | 934 | 100.00 +| 0452 |[Minimum Number of Arrows to Burst Balloons](src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt)| Medium | Array, Sorting, Greedy, LeetCode_75_Intervals | 934 | 100.00 #### Top Interview 150 Stack @@ -1439,7 +1439,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 +| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 | 0100 |[Same Tree](src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 134 | 86.63 | 0226 |[Invert Binary Tree](src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 233 | 54.90 | 0101 |[Symmetric Tree](src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35 @@ -1452,13 +1452,13 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0124 |[Binary Tree Maximum Path Sum](src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 331 | 74.42 | 0173 |[Binary Search Tree Iterator](src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt)| Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 563 | 46.91 | 0222 |[Count Complete Tree Nodes](src/main/kotlin/g0201_0300/s0222_count_complete_tree_nodes/Solution.kt)| Easy | Depth_First_Search, Tree, Binary_Search, Binary_Tree | 0 | 100.00 -| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 #### Top Interview 150 Binary Tree BFS | | | | | | |-|-|-|-|-|- -| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 +| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 194 | 92.89 | 0637 |[Average of Levels in Binary Tree](src/main/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 249 | 100.00 | 0102 |[Binary Tree Level Order Traversal](src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 198 | 95.14 | 0103 |[Binary Tree Zigzag Level Order Traversal](src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 176 | 71.62 @@ -1478,7 +1478,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0200 |[Number of Islands](src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 252 | 95.41 | 0130 |[Surrounded Regions](src/main/kotlin/g0101_0200/s0130_surrounded_regions/Solution.kt)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 355 | 84.42 | 0133 |[Clone Graph](src/main/kotlin/g0101_0200/s0133_clone_graph/Solution.kt)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 351 | 60.91 -| 0399 |[Evaluate Division](src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt)| Medium | Array, Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Shortest_Path | 183 | 91.49 +| 0399 |[Evaluate Division](src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt)| Medium | Array, Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Shortest_Path, LeetCode_75_Graphs/DFS | 183 | 91.49 | 0207 |[Course Schedule](src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N) | 183 | 92.07 | 0210 |[Course Schedule II](src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 266 | 96.32 @@ -1494,7 +1494,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 +| 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 | 0211 |[Design Add and Search Words Data Structure](src/main/kotlin/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.kt)| Medium | String, Depth_First_Search, Design, Trie | 2256 | 87.04 | 0212 |[Word Search II](src/main/kotlin/g0201_0300/s0212_word_search_ii/Solution.kt)| Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie | 268 | 100.00 @@ -1502,7 +1502,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0017 |[Letter Combinations of a Phone Number](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 +| 0017 |[Letter Combinations of a Phone Number](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 | 0077 |[Combinations](src/main/kotlin/g0001_0100/s0077_combinations/Solution.kt)| Medium | Backtracking | 232 | 100.00 | 0046 |[Permutations](src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 188 | 99.00 | 0039 |[Combination Sum](src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 226 | 88.89 @@ -1532,7 +1532,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 0035 |[Search Insert Position](src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 159 | 93.03 | 0074 |[Search a 2D Matrix](src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 159 | 74.46 -| 0162 |[Find Peak Element](src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt)| Medium | Top_Interview_Questions, Array, Binary_Search | 297 | 53.85 +| 0162 |[Find Peak Element](src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 297 | 53.85 | 0033 |[Search in Rotated Sorted Array](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 151 | 93.77 | 0034 |[Find First and Last Position of Element in Sorted Array](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 174 | 100.00 | 0153 |[Find Minimum in Rotated Sorted Array](src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 262 | 60.96 @@ -1542,7 +1542,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0215 |[Kth Largest Element in an Array](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 839 | 34.43 +| 0215 |[Kth Largest Element in an Array](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 839 | 34.43 | 0502 |[IPO](src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt)| Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 799 | 54.55 | 0373 |[Find K Pairs with Smallest Sums](src/main/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.kt)| Medium | Array, Heap_Priority_Queue | 1809 | 80.95 | 0295 |[Find Median from Data Stream](src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 2289 | 33.60 @@ -1554,7 +1554,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0067 |[Add Binary](src/main/kotlin/g0001_0100/s0067_add_binary/Solution.kt)| Easy | String, Math, Bit_Manipulation, Simulation | 164 | 90.60 | 0190 |[Reverse Bits](src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 198 | 81.82 | 0191 |[Number of 1 Bits](src/main/kotlin/g0101_0200/s0191_number_of_1_bits/Solution.kt)| Easy | Top_Interview_Questions, Bit_Manipulation | 237 | 68.44 -| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 +| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 | 0137 |[Single Number II](src/main/kotlin/g0101_0200/s0137_single_number_ii/Solution.kt)| Medium | Array, Bit_Manipulation | 344 | 64.29 | 0201 |[Bitwise AND of Numbers Range](src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt)| Medium | Bit_Manipulation | 368 | 80.00 @@ -1574,7 +1574,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0070 |[Climbing Stairs](src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 124 | 71.98 -| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 +| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 | 0139 |[Word Break](src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 197 | 87.17 | 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68 | 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28 @@ -1588,7 +1588,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | 0063 |[Unique Paths II](src/main/kotlin/g0001_0100/s0063_unique_paths_ii/Solution.kt)| Medium | Array, Dynamic_Programming, Matrix | 151 | 81.94 | 0005 |[Longest Palindromic Substring](src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 162 | 99.00 | 0097 |[Interleaving String](src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt)| Medium | String, Dynamic_Programming | 149 | 81.58 -| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 +| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 | 0123 |[Best Time to Buy and Sell Stock III](src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt)| Hard | Array, Dynamic_Programming | 585 | 95.24 | 0188 |[Best Time to Buy and Sell Stock IV](src/main/kotlin/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.kt)| Hard | Array, Dynamic_Programming | 293 | 68.31 | 0221 |[Maximal Square](src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 614 | 44.00 @@ -1650,7 +1650,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 +| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 | 0083 |[Remove Duplicates from Sorted List](src/main/kotlin/g0001_0100/s0083_remove_duplicates_from_sorted_list/Solution.kt)| Easy | Linked_List | 173 | 82.42 #### Day 9 Stack Queue @@ -1673,7 +1673,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0102 |[Binary Tree Level Order Traversal](src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 198 | 95.14 -| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 +| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 | 0101 |[Symmetric Tree](src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35 #### Day 12 Tree @@ -1687,7 +1687,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0700 |[Search in a Binary Search Tree](src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt)| Easy | Tree, Binary_Tree, Binary_Search_Tree | 251 | 88.31 +| 0700 |[Search in a Binary Search Tree](src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt)| Easy | Tree, Binary_Tree, Binary_Search_Tree, LeetCode_75_Binary_Search_Tree | 251 | 88.31 | 0701 |[Insert into a Binary Search Tree](src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 311 | 79.03 #### Day 14 Tree @@ -1704,7 +1704,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 +| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 | 0169 |[Majority Element](src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 460 | 51.25 | 0015 |[3Sum](src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 493 | 93.45 @@ -1729,14 +1729,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0240 |[Search a 2D Matrix II](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 460 | 66.08 -| 0435 |[Non-overlapping Intervals](src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt)| Medium | Array, Dynamic_Programming, Sorting, Greedy | 1040 | 85.07 +| 0435 |[Non-overlapping Intervals](src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt)| Medium | Array, Dynamic_Programming, Sorting, Greedy, LeetCode_75_Intervals | 1040 | 85.07 #### Day 5 Array | | | | | | |-|-|-|-|-|- -| 0334 |[Increasing Triplet Subsequence](src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt)| Medium | Array, Greedy | 672 | 60.61 -| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 +| 0334 |[Increasing Triplet Subsequence](src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt)| Medium | Array, Greedy, LeetCode_75_Array/String | 672 | 60.61 +| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 | 0560 |[Subarray Sum Equals K](src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 692 | 53.27 #### Day 6 String @@ -1815,9 +1815,9 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 +| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 194 | 92.89 | 0113 |[Path Sum II](src/main/kotlin/g0101_0200/s0113_path_sum_ii/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking | 364 | 78.67 -| 0450 |[Delete Node in a BST](src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 257 | 84.62 +| 0450 |[Delete Node in a BST](src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree, LeetCode_75_Binary_Search_Tree | 257 | 84.62 #### Day 17 Tree @@ -1830,7 +1830,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 | 0297 |[Serialize and Deserialize Binary Tree](src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt)| Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85 #### Day 19 Graph @@ -1839,13 +1839,13 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 0997 |[Find the Town Judge](src/main/kotlin/g0901_1000/s0997_find_the_town_judge/Solution.kt)| Easy | Array, Hash_Table, Graph | 475 | 58.62 | 1557 |[Minimum Number of Vertices to Reach All Nodes](src/main/kotlin/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.kt)| Medium | Graph | 792 | 99.29 -| 0841 |[Keys and Rooms](src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 189 | 69.23 +| 0841 |[Keys and Rooms](src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 189 | 69.23 #### Day 20 Heap Priority Queue | | | | | | |-|-|-|-|-|- -| 0215 |[Kth Largest Element in an Array](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 839 | 34.43 +| 0215 |[Kth Largest Element in an Array](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 839 | 34.43 | 0347 |[Top K Frequent Elements](src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n\*log(n))_Space_O(k) | 268 | 99.74 #### Day 21 Heap Priority Queue @@ -1876,7 +1876,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07 +| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07 | 0167 |[Two Sum II - Input Array Is Sorted](src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt)| Medium | Array, Binary_Search, Two_Pointers | 403 | 68.74 #### Day 4 Two Pointers @@ -1919,14 +1919,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0542 |[01 Matrix](src/main/kotlin/g0501_0600/s0542_01_matrix/Solution.kt)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 441 | 94.06 -| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix | 164 | 82.95 +| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 164 | 82.95 #### Day 10 Recursion Backtracking | | | | | | |-|-|-|-|-|- | 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24 -| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 +| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 #### Day 11 Recursion Backtracking @@ -1941,7 +1941,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0070 |[Climbing Stairs](src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 124 | 71.98 -| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 +| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 | 0120 |[Triangle](src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt)| Medium | Array, Dynamic_Programming | 194 | 97.87 #### Day 13 Bit Manipulation @@ -1956,7 +1956,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0190 |[Reverse Bits](src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 198 | 81.82 -| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 +| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 ### Algorithm II @@ -1973,7 +1973,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0153 |[Find Minimum in Rotated Sorted Array](src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 262 | 60.96 -| 0162 |[Find Peak Element](src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt)| Medium | Top_Interview_Questions, Array, Binary_Search | 297 | 53.85 +| 0162 |[Find Peak Element](src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 297 | 53.85 #### Day 3 Two Pointers @@ -1988,7 +1988,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' |-|-|-|-|-|- | 0844 |[Backspace String Compare](src/main/kotlin/g0801_0900/s0844_backspace_string_compare/Solution.kt)| Easy | String, Two_Pointers, Stack, Simulation | 126 | 98.31 | 0986 |[Interval List Intersections](src/main/kotlin/g0901_1000/s0986_interval_list_intersections/Solution.kt)| Medium | Array, Two_Pointers | 318 | 60.98 -| 0011 |[Container With Most Water](src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 402 | 78.57 +| 0011 |[Container With Most Water](src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 402 | 78.57 #### Day 5 Sliding Window @@ -2003,7 +2003,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0200 |[Number of Islands](src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 252 | 95.41 -| 0547 |[Number of Provinces](src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 229 | 79.73 +| 0547 |[Number of Provinces](src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 229 | 79.73 #### Day 7 Breadth First Search Depth First Search @@ -2039,7 +2039,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 0017 |[Letter Combinations of a Phone Number](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 +| 0017 |[Letter Combinations of a Phone Number](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 | 0022 |[Generate Parentheses](src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 161 | 85.45 | 0079 |[Word Search](src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 392 | 72.92 @@ -2055,7 +2055,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- | 0045 |[Jump Game II](src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 208 | 93.37 -| 0062 |[Unique Paths](src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 118 | 94.65 +| 0062 |[Unique Paths](src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 118 | 94.65 #### Day 14 Dynamic Programming @@ -2082,14 +2082,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.35' | | | | | | |-|-|-|-|-|- -| 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36 +| 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36 | 0583 |[Delete Operation for Two Strings](src/main/kotlin/g0501_0600/s0583_delete_operation_for_two_strings/Solution.kt)| Medium | String, Dynamic_Programming | 197 | 100.00 #### Day 18 Dynamic Programming | | | | | | |-|-|-|-|-|- -| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 +| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 | 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68 | 0343 |[Integer Break](src/main/kotlin/g0301_0400/s0343_integer_break/Solution.kt)| Medium | Dynamic_Programming, Math | 218 | 63.89 diff --git a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt index d3b39ab8c..b74ba246b 100644 --- a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0011_container_with_most_water // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%) class Solution { fun maxArea(height: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt index fecc2bd9f..ac397e83e 100644 --- a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0017_letter_combinations_of_a_phone_number // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) // #2023_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt b/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt index 0a1951c87..c8b298141 100644 --- a/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt @@ -1,9 +1,9 @@ package g0001_0100.s0062_unique_paths // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math -// #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15 -// #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n) -// #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming +// #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming +// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%) class Solution { fun uniquePaths(m: Int, n: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt index 89da79540..c456d1a3d 100644 --- a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0072_edit_distance -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%) diff --git a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt index 60bd48b25..c820f59b9 100644 --- a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0104_maximum_depth_of_binary_tree // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue // #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) // #2023_07_11_Time_166_ms_(83.53%)_Space_36.5_MB_(86.11%) diff --git a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt index 31c03a1f3..dbc909c3f 100644 --- a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt @@ -1,9 +1,9 @@ package g0101_0200.s0136_single_number // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers -// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1) -// #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%) +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation +// #Big_O_Time_O(N)_Space_O(1) #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%) class Solution { fun singleNumber(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt b/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt index e972bb4e4..bb8d43baa 100644 --- a/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0151_reverse_words_in_a_string -// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String -// #2022_10_11_Time_206_ms_(98.90%)_Space_36.1_MB_(96.70%) +// #Medium #String #Two_Pointers #LeetCode_75_Array/String #Udemy_Strings +// #Top_Interview_150_Array/String #2022_10_11_Time_206_ms_(98.90%)_Space_36.1_MB_(96.70%) class Solution { fun reverseWords(s: String): String { diff --git a/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt b/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt index bc7260d73..4006377d1 100644 --- a/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0162_find_peak_element -// #Medium #Top_Interview_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search +// #Medium #Top_Interview_Questions #Array #Binary_Search #LeetCode_75_Binary_Search +// #Algorithm_II_Day_2_Binary_Search #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search // #2022_10_11_Time_297_ms_(53.85%)_Space_36.8_MB_(66.27%) class Solution { diff --git a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt index 3d30e4a41..df63a0e78 100644 --- a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0198_house_robber // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 // #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP // #Big_O_Time_O(n)_Space_O(n) #2022_09_08_Time_156_ms_(92.24%)_Space_34.1_MB_(61.64%) diff --git a/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt b/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt index 96319387d..60e70e528 100644 --- a/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0199_binary_tree_right_side_view // #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree #Top_Interview_150_Binary_Tree_BFS -// #2022_09_09_Time_194_ms_(92.89%)_Space_35.4_MB_(67.89%) +// #LeetCode_75_Binary_Tree/BFS #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree +// #Top_Interview_150_Binary_Tree_BFS #2022_09_09_Time_194_ms_(92.89%)_Space_35.4_MB_(67.89%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt b/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt index c4135e6e9..53843930a 100644 --- a/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt @@ -1,9 +1,9 @@ package g0201_0300.s0206_reverse_linked_list // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2022_09_27_Time_279_ms_(45.78%)_Space_36.2_MB_(49.40%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2022_09_27_Time_279_ms_(45.78%)_Space_36.2_MB_(49.40%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt index 7b1951ff2..66a9c5725 100644 --- a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt +++ b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt @@ -1,7 +1,7 @@ package g0201_0300.s0208_implement_trie_prefix_tree // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2022_09_10_Time_689_ms_(61.00%)_Space_87.9_MB_(36.00%) diff --git a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt index 659dccf5e..afc7a88fc 100644 --- a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt @@ -1,9 +1,9 @@ package g0201_0300.s0215_kth_largest_element_in_an_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n)) -// #2022_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%) +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap +// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2022_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%) class Solution { fun findKthLargest(nums: IntArray, k: Int): Int { diff --git a/src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt b/src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt index eaf4c827f..50699e392 100644 --- a/src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt @@ -1,6 +1,6 @@ package g0201_0300.s0216_combination_sum_iii -// #Medium #Array #Backtracking #Udemy_Backtracking/Recursion +// #Medium #Array #Backtracking #LeetCode_75_Backtracking #Udemy_Backtracking/Recursion // #2022_10_25_Time_175_ms_(90.91%)_Space_34.4_MB_(72.73%) class Solution { diff --git a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt index 99698cb75..b104864c2 100644 --- a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt @@ -1,8 +1,9 @@ package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General -// #Big_O_Time_O(n)_Space_O(n) #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%) +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt index cc14941de..f4d01ea2b 100644 --- a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt @@ -1,8 +1,8 @@ package g0201_0300.s0238_product_of_array_except_self -// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays -// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n) -// #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%) +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n^2)_Space_O(n) #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%) class Solution { fun productExceptSelf(nums: IntArray): IntArray { diff --git a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt index 5f6344c0c..fe0fa1220 100644 --- a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt @@ -1,8 +1,8 @@ package g0201_0300.s0283_move_zeroes -// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers -// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +// #Big_O_Time_O(n)_Space_O(1) #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%) class Solution { fun moveZeroes(nums: IntArray) { diff --git a/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt b/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt index a60287292..b14003274 100644 --- a/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt @@ -1,6 +1,6 @@ package g0301_0400.s0328_odd_even_linked_list -// #Medium #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List +// #Medium #Linked_List #LeetCode_75_LinkedList #Level_2_Day_4_Linked_List #Udemy_Linked_List // #2022_11_12_Time_216_ms_(86.96%)_Space_36.7_MB_(85.22%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt b/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt index 476c99121..1864d9fb6 100644 --- a/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt @@ -1,6 +1,6 @@ package g0301_0400.s0334_increasing_triplet_subsequence -// #Medium #Array #Greedy #Data_Structure_II_Day_5_Array +// #Medium #Array #Greedy #LeetCode_75_Array/String #Data_Structure_II_Day_5_Array // #2022_11_15_Time_672_ms_(60.61%)_Space_128.6_MB_(5.23%) class Solution { diff --git a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt index 1af442503..c0e3d42ac 100644 --- a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt @@ -1,7 +1,8 @@ package g0301_0400.s0338_counting_bits -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%) class Solution { fun countBits(num: Int): IntArray { diff --git a/src/main/kotlin/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.kt b/src/main/kotlin/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.kt index 68e6ec3ad..945eeb7c3 100644 --- a/src/main/kotlin/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.kt @@ -1,6 +1,7 @@ package g0301_0400.s0345_reverse_vowels_of_a_string -// #Easy #String #Two_Pointers #2022_11_18_Time_349_ms_(80.63%)_Space_42.2_MB_(76.91%) +// #Easy #String #Two_Pointers #LeetCode_75_Array/String +// #2022_11_18_Time_349_ms_(80.63%)_Space_42.2_MB_(76.91%) class Solution { private fun isVowel(c: Char): Boolean { diff --git a/src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt b/src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt index 3c73554aa..e4e613375 100644 --- a/src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt @@ -1,6 +1,6 @@ package g0301_0400.s0374_guess_number_higher_or_lower -// #Easy #Binary_Search #Interactive #Binary_Search_I_Day_1 +// #Easy #Binary_Search #Interactive #LeetCode_75_Binary_Search #Binary_Search_I_Day_1 // #2022_11_22_Time_134_ms_(94.19%)_Space_32.6_MB_(98.60%) /* diff --git a/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt b/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt index 1236444c6..6891814a1 100644 --- a/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt @@ -1,8 +1,8 @@ package g0301_0400.s0392_is_subsequence -// #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19 -// #Level_1_Day_2_String #Udemy_Two_Pointers #Top_Interview_150_Two_Pointers -// #2022_11_25_Time_156_ms_(87.74%)_Space_33.9_MB_(90.11%) +// #Easy #String #Dynamic_Programming #Two_Pointers #LeetCode_75_Two_Pointers +// #Dynamic_Programming_I_Day_19 #Level_1_Day_2_String #Udemy_Two_Pointers +// #Top_Interview_150_Two_Pointers #2022_11_25_Time_156_ms_(87.74%)_Space_33.9_MB_(90.11%) class Solution { fun isSubsequence(s: String, t: String): Boolean { diff --git a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt index eb26cd478..40d7859a0 100644 --- a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt @@ -1,7 +1,8 @@ package g0301_0400.s0394_decode_string -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%) class Solution { private var i = 0 diff --git a/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt b/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt index 50dabe81a..bfe0cd168 100644 --- a/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt @@ -1,7 +1,8 @@ package g0301_0400.s0399_evaluate_division // #Medium #Array #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #Shortest_Path -// #Top_Interview_150_Graph_General #2022_11_29_Time_183_ms_(91.49%)_Space_34.6_MB_(95.74%) +// #LeetCode_75_Graphs/DFS #Top_Interview_150_Graph_General +// #2022_11_29_Time_183_ms_(91.49%)_Space_34.6_MB_(95.74%) @Suppress("kotlin:S6518") class Solution { diff --git a/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt b/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt index 512c88c2b..715e0bf22 100644 --- a/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt @@ -1,7 +1,7 @@ package g0401_0500.s0435_non_overlapping_intervals -// #Medium #Array #Dynamic_Programming #Sorting #Greedy #Data_Structure_II_Day_4_Array -// #2022_12_22_Time_1040_ms_(85.07%)_Space_117.9_MB_(82.09%) +// #Medium #Array #Dynamic_Programming #Sorting #Greedy #LeetCode_75_Intervals +// #Data_Structure_II_Day_4_Array #2022_12_22_Time_1040_ms_(85.07%)_Space_117.9_MB_(82.09%) class Solution { fun eraseOverlapIntervals(intervals: Array): Int { diff --git a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt index 18a471b39..29c247a12 100644 --- a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt @@ -1,7 +1,7 @@ package g0401_0500.s0437_path_sum_iii -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -// #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0401_0500/s0443_string_compression/Solution.kt b/src/main/kotlin/g0401_0500/s0443_string_compression/Solution.kt index 92834e24b..a9ba63fbe 100644 --- a/src/main/kotlin/g0401_0500/s0443_string_compression/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0443_string_compression/Solution.kt @@ -1,6 +1,7 @@ package g0401_0500.s0443_string_compression -// #Medium #String #Two_Pointers #2022_12_23_Time_198_ms_(92.68%)_Space_35.4_MB_(95.12%) +// #Medium #String #Two_Pointers #LeetCode_75_Array/String +// #2022_12_23_Time_198_ms_(92.68%)_Space_35.4_MB_(95.12%) class Solution { /* This is breaking the rules, it's not in-place. */ diff --git a/src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt b/src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt index bf1366d3b..0124d8601 100644 --- a/src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt @@ -1,7 +1,7 @@ package g0401_0500.s0450_delete_node_in_a_bst -// #Medium #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_II_Day_16_Tree -// #2022_12_25_Time_257_ms_(84.62%)_Space_38.6_MB_(92.31%) +// #Medium #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree +// #Data_Structure_II_Day_16_Tree #2022_12_25_Time_257_ms_(84.62%)_Space_38.6_MB_(92.31%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt b/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt index 77bf61a37..8ad10566f 100644 --- a/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt @@ -1,6 +1,6 @@ package g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons -// #Medium #Array #Sorting #Greedy #Top_Interview_150_Intervals +// #Medium #Array #Sorting #Greedy #LeetCode_75_Intervals #Top_Interview_150_Intervals // #2022_12_25_Time_934_ms_(100.00%)_Space_87_MB_(100.00%) class Solution { diff --git a/src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt b/src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt index 917ebdc01..a40fac0cf 100644 --- a/src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt +++ b/src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt @@ -1,6 +1,6 @@ package g0501_0600.s0547_number_of_provinces -// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find +// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #LeetCode_75_Graphs/DFS // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_8_Standard_Traversal #Level_2_Day_19_Union_Find // #2023_01_17_Time_229_ms_(79.73%)_Space_43_MB_(66.22%) diff --git a/src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt b/src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt index a93ac75e9..10cb68643 100644 --- a/src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt +++ b/src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt @@ -1,6 +1,7 @@ package g0601_0700.s0605_can_place_flowers -// #Easy #Array #Greedy #Udemy_Arrays #2023_02_03_Time_209_ms_(85.71%)_Space_37.3_MB_(71.43%) +// #Easy #Array #Greedy #LeetCode_75_Array/String #Udemy_Arrays +// #2023_02_03_Time_209_ms_(85.71%)_Space_37.3_MB_(71.43%) @Suppress("NAME_SHADOWING") class Solution { diff --git a/src/main/kotlin/g0601_0700/s0643_maximum_average_subarray_i/Solution.kt b/src/main/kotlin/g0601_0700/s0643_maximum_average_subarray_i/Solution.kt index f97b8fa20..f516650b9 100644 --- a/src/main/kotlin/g0601_0700/s0643_maximum_average_subarray_i/Solution.kt +++ b/src/main/kotlin/g0601_0700/s0643_maximum_average_subarray_i/Solution.kt @@ -1,6 +1,7 @@ package g0601_0700.s0643_maximum_average_subarray_i -// #Easy #Array #Sliding_Window #2023_02_11_Time_494_ms_(98.65%)_Space_45.8_MB_(95.95%) +// #Easy #Array #Sliding_Window #LeetCode_75_Sliding_Window +// #2023_02_11_Time_494_ms_(98.65%)_Space_45.8_MB_(95.95%) class Solution { fun findMaxAverage(nums: IntArray, k: Int): Double { diff --git a/src/main/kotlin/g0601_0700/s0649_dota2_senate/Solution.kt b/src/main/kotlin/g0601_0700/s0649_dota2_senate/Solution.kt index 57c1a6b72..f84de5caf 100644 --- a/src/main/kotlin/g0601_0700/s0649_dota2_senate/Solution.kt +++ b/src/main/kotlin/g0601_0700/s0649_dota2_senate/Solution.kt @@ -1,6 +1,7 @@ package g0601_0700.s0649_dota2_senate -// #Medium #String #Greedy #Queue #2023_02_12_Time_217_ms_(100.00%)_Space_36.1_MB_(100.00%) +// #Medium #String #Greedy #Queue #LeetCode_75_Queue +// #2023_02_12_Time_217_ms_(100.00%)_Space_36.1_MB_(100.00%) class Solution { fun predictPartyVictory(senate: String): String { diff --git a/src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt b/src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt index a44a7396a..f7d148b0a 100644 --- a/src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt +++ b/src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt @@ -1,7 +1,7 @@ package g0601_0700.s0700_search_in_a_binary_search_tree -// #Easy #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_13_Tree -// #2023_02_22_Time_251_ms_(88.31%)_Space_51_MB_(7.79%) +// #Easy #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree +// #Data_Structure_I_Day_13_Tree #2023_02_22_Time_251_ms_(88.31%)_Space_51_MB_(7.79%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt b/src/main/kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt index aaac9e3e1..f133b3b18 100644 --- a/src/main/kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt @@ -1,7 +1,7 @@ package g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee -// #Medium #Array #Dynamic_Programming #Greedy #Dynamic_Programming_I_Day_8 -// #2023_02_25_Time_417_ms_(90.91%)_Space_46.1_MB_(75.00%) +// #Medium #Array #Dynamic_Programming #Greedy #LeetCode_75_DP/Multidimensional +// #Dynamic_Programming_I_Day_8 #2023_02_25_Time_417_ms_(90.91%)_Space_46.1_MB_(75.00%) class Solution { fun maxProfit(prices: IntArray, fee: Int): Int { diff --git a/src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt b/src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt index 39ed15750..343d48ea5 100644 --- a/src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt @@ -1,6 +1,6 @@ package g0701_0800.s0724_find_pivot_index -// #Easy #Array #Prefix_Sum #Level_1_Day_1_Prefix_Sum +// #Easy #Array #Prefix_Sum #LeetCode_75_Prefix_Sum #Level_1_Day_1_Prefix_Sum // #2023_02_28_Time_255_ms_(88.92%)_Space_38.7_MB_(93.26%) class Solution { diff --git a/src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt b/src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt index a9e7b06aa..136f8ff41 100644 --- a/src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt @@ -1,6 +1,6 @@ package g0701_0800.s0735_asteroid_collision -// #Medium #Array #Stack #Level_2_Day_18_Stack +// #Medium #Array #Stack #LeetCode_75_Stack #Level_2_Day_18_Stack // #2023_03_02_Time_243_ms_(100.00%)_Space_37.9_MB_(88.46%) import java.util.Deque diff --git a/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt b/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt index 89b91047d..9b11266de 100644 --- a/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt @@ -1,7 +1,8 @@ package g0701_0800.s0739_daily_temperatures -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2022_09_13_Time_936_ms_(80.54%)_Space_79.5_MB_(63.09%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2022_09_13_Time_936_ms_(80.54%)_Space_79.5_MB_(63.09%) class Solution { fun dailyTemperatures(temperatures: IntArray): IntArray { diff --git a/src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt b/src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt index 13515dc75..4af985f44 100644 --- a/src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt @@ -1,6 +1,6 @@ package g0701_0800.s0746_min_cost_climbing_stairs -// #Easy #Array #Dynamic_Programming #Dynamic_Programming_I_Day_2 +// #Easy #Array #Dynamic_Programming #LeetCode_75_DP/1D #Dynamic_Programming_I_Day_2 // #Level_1_Day_11_Dynamic_Programming #2023_03_04_Time_171_ms_(96.76%)_Space_36_MB_(78.14%) class Solution { diff --git a/src/main/kotlin/g0701_0800/s0790_domino_and_tromino_tiling/Solution.kt b/src/main/kotlin/g0701_0800/s0790_domino_and_tromino_tiling/Solution.kt index c92141bac..9ee2c9281 100644 --- a/src/main/kotlin/g0701_0800/s0790_domino_and_tromino_tiling/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0790_domino_and_tromino_tiling/Solution.kt @@ -1,6 +1,7 @@ package g0701_0800.s0790_domino_and_tromino_tiling -// #Medium #Dynamic_Programming #2023_03_13_Time_116_ms_(100.00%)_Space_32.6_MB_(100.00%) +// #Medium #Dynamic_Programming #LeetCode_75_DP/1D +// #2023_03_13_Time_116_ms_(100.00%)_Space_32.6_MB_(100.00%) class Solution { fun numTilings(n: Int): Int { diff --git a/src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt b/src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt index 3e958de0d..e9242395a 100644 --- a/src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt +++ b/src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt @@ -1,7 +1,8 @@ package g0801_0900.s0841_keys_and_rooms -// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Data_Structure_II_Day_19_Graph -// #Graph_Theory_I_Day_7_Standard_Traversal #2023_03_28_Time_189_ms_(69.23%)_Space_35.5_MB_(97.44%) +// #Medium #Depth_First_Search #Breadth_First_Search #Graph #LeetCode_75_Graphs/DFS +// #Data_Structure_II_Day_19_Graph #Graph_Theory_I_Day_7_Standard_Traversal +// #2023_03_28_Time_189_ms_(69.23%)_Space_35.5_MB_(97.44%) import java.util.TreeSet diff --git a/src/main/kotlin/g0801_0900/s0872_leaf_similar_trees/Solution.kt b/src/main/kotlin/g0801_0900/s0872_leaf_similar_trees/Solution.kt index c037f8e55..09ca4e21f 100644 --- a/src/main/kotlin/g0801_0900/s0872_leaf_similar_trees/Solution.kt +++ b/src/main/kotlin/g0801_0900/s0872_leaf_similar_trees/Solution.kt @@ -1,6 +1,6 @@ package g0801_0900.s0872_leaf_similar_trees -// #Easy #Depth_First_Search #Tree #Binary_Tree +// #Easy #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS // #2023_04_08_Time_140_ms_(100.00%)_Space_33.9_MB_(64.29%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0801_0900/s0875_koko_eating_bananas/Solution.kt b/src/main/kotlin/g0801_0900/s0875_koko_eating_bananas/Solution.kt index 3dd1fa5d3..e99262332 100644 --- a/src/main/kotlin/g0801_0900/s0875_koko_eating_bananas/Solution.kt +++ b/src/main/kotlin/g0801_0900/s0875_koko_eating_bananas/Solution.kt @@ -1,6 +1,6 @@ package g0801_0900.s0875_koko_eating_bananas -// #Medium #Array #Binary_Search #Binary_Search_II_Day_4 +// #Medium #Array #Binary_Search #LeetCode_75_Binary_Search #Binary_Search_II_Day_4 // #2023_04_08_Time_267_ms_(93.85%)_Space_37.7_MB_(96.62%) class Solution { diff --git a/src/main/kotlin/g0901_1000/s0901_online_stock_span/StockSpanner.kt b/src/main/kotlin/g0901_1000/s0901_online_stock_span/StockSpanner.kt index a8021efe0..8c533a98d 100644 --- a/src/main/kotlin/g0901_1000/s0901_online_stock_span/StockSpanner.kt +++ b/src/main/kotlin/g0901_1000/s0901_online_stock_span/StockSpanner.kt @@ -1,6 +1,6 @@ package g0901_1000.s0901_online_stock_span -// #Medium #Stack #Design #Monotonic_Stack #Data_Stream +// #Medium #Stack #Design #Monotonic_Stack #Data_Stream #LeetCode_75_Monotonic_Stack // #2023_04_13_Time_641_ms_(75.00%)_Space_66.5_MB_(10.71%) import java.util.Deque diff --git a/src/main/kotlin/g0901_1000/s0933_number_of_recent_calls/RecentCounter.kt b/src/main/kotlin/g0901_1000/s0933_number_of_recent_calls/RecentCounter.kt index 065468e58..506613e90 100644 --- a/src/main/kotlin/g0901_1000/s0933_number_of_recent_calls/RecentCounter.kt +++ b/src/main/kotlin/g0901_1000/s0933_number_of_recent_calls/RecentCounter.kt @@ -1,6 +1,7 @@ package g0901_1000.s0933_number_of_recent_calls -// #Easy #Design #Queue #Data_Stream #2023_04_27_Time_476_ms_(82.50%)_Space_107.1_MB_(5.00%) +// #Easy #Design #Queue #Data_Stream #LeetCode_75_Queue +// #2023_04_27_Time_476_ms_(82.50%)_Space_107.1_MB_(5.00%) import java.util.LinkedList import java.util.Queue diff --git a/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt b/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt index 9cf7c4585..aa8268095 100644 --- a/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt +++ b/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt @@ -1,6 +1,6 @@ package g0901_1000.s0994_rotting_oranges -// #Medium #Top_100_Liked_Questions #Array #Breadth_First_Search #Matrix +// #Medium #Top_100_Liked_Questions #Array #Breadth_First_Search #Matrix #LeetCode_75_Graphs/BFS // #Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search #Level_2_Day_10_Graph/BFS/DFS // #2023_05_22_Time_164_ms_(82.95%)_Space_36.2_MB_(49.61%) diff --git a/src/main/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/Solution.kt b/src/main/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/Solution.kt index a10a8cc4b..30fba1fcc 100644 --- a/src/main/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/Solution.kt +++ b/src/main/kotlin/g1001_1100/s1004_max_consecutive_ones_iii/Solution.kt @@ -1,6 +1,6 @@ package g1001_1100.s1004_max_consecutive_ones_iii -// #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window +// #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window #LeetCode_75_Sliding_Window // #2023_05_14_Time_318_ms_(30.95%)_Space_84.7_MB_(8.33%) class Solution { diff --git a/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt b/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt index 72c9cddfe..5f046032c 100644 --- a/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt +++ b/src/main/kotlin/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.kt @@ -1,6 +1,7 @@ package g1001_1100.s1071_greatest_common_divisor_of_strings -// #Easy #String #Math #2023_05_31_Time_150_ms_(80.68%)_Space_36.2_MB_(84.09%) +// #Easy #String #Math #LeetCode_75_Array/String +// #2023_05_31_Time_150_ms_(80.68%)_Space_36.2_MB_(84.09%) class Solution { fun gcdOfStrings(str1: String?, str2: String?): String { diff --git a/src/main/kotlin/g1101_1200/s1137_n_th_tribonacci_number/Solution.kt b/src/main/kotlin/g1101_1200/s1137_n_th_tribonacci_number/Solution.kt index 2cdda5dfe..9d6c6b9a3 100644 --- a/src/main/kotlin/g1101_1200/s1137_n_th_tribonacci_number/Solution.kt +++ b/src/main/kotlin/g1101_1200/s1137_n_th_tribonacci_number/Solution.kt @@ -1,6 +1,6 @@ package g1101_1200.s1137_n_th_tribonacci_number -// #Easy #Dynamic_Programming #Math #Memoization #Dynamic_Programming_I_Day_1 +// #Easy #Dynamic_Programming #Math #Memoization #LeetCode_75_DP/1D #Dynamic_Programming_I_Day_1 // #2023_05_31_Time_122_ms_(69.35%)_Space_33.6_MB_(64.52%) class Solution { diff --git a/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt b/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt index d55d72947..325ff703d 100644 --- a/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt +++ b/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt @@ -1,6 +1,6 @@ package g1101_1200.s1143_longest_common_subsequence -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2022_09_13_Time_307_ms_(38.36%)_Space_38.7_MB_(86.99%) diff --git a/src/main/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.kt b/src/main/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.kt index 5355849fd..656656928 100644 --- a/src/main/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.kt +++ b/src/main/kotlin/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.kt @@ -1,6 +1,6 @@ package g1101_1200.s1161_maximum_level_sum_of_a_binary_tree -// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree +// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/BFS // #2023_05_25_Time_445_ms_(87.50%)_Space_97.1_MB_(75.00%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g1201_1300/s1207_unique_number_of_occurrences/Solution.kt b/src/main/kotlin/g1201_1300/s1207_unique_number_of_occurrences/Solution.kt index 93e24919b..2692cf7c1 100644 --- a/src/main/kotlin/g1201_1300/s1207_unique_number_of_occurrences/Solution.kt +++ b/src/main/kotlin/g1201_1300/s1207_unique_number_of_occurrences/Solution.kt @@ -1,6 +1,7 @@ package g1201_1300.s1207_unique_number_of_occurrences -// #Easy #Array #Hash_Table #2023_06_10_Time_151_ms_(83.00%)_Space_33.9_MB_(100.00%) +// #Easy #Array #Hash_Table #LeetCode_75_Hash_Map/Set +// #2023_06_10_Time_151_ms_(83.00%)_Space_33.9_MB_(100.00%) class Solution { fun uniqueOccurrences(arr: IntArray): Boolean { diff --git a/src/main/kotlin/g1201_1300/s1268_search_suggestions_system/Solution.kt b/src/main/kotlin/g1201_1300/s1268_search_suggestions_system/Solution.kt index e1b5ef971..f7d0cbf31 100644 --- a/src/main/kotlin/g1201_1300/s1268_search_suggestions_system/Solution.kt +++ b/src/main/kotlin/g1201_1300/s1268_search_suggestions_system/Solution.kt @@ -1,6 +1,6 @@ package g1201_1300.s1268_search_suggestions_system -// #Medium #Array #String #2023_06_08_Time_331_ms_(100.00%)_Space_50.2_MB_(88.89%) +// #Medium #Array #String #LeetCode_75_Trie #2023_06_08_Time_331_ms_(100.00%)_Space_50.2_MB_(88.89%) class Solution { private var result: MutableList> = ArrayList() diff --git a/src/main/kotlin/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.kt b/src/main/kotlin/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.kt index b273ff621..829c38e6c 100644 --- a/src/main/kotlin/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.kt +++ b/src/main/kotlin/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.kt @@ -1,6 +1,7 @@ package g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c -// #Medium #Bit_Manipulation #2023_06_05_Time_123_ms_(88.89%)_Space_33.2_MB_(88.89%) +// #Medium #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #2023_06_05_Time_123_ms_(88.89%)_Space_33.2_MB_(88.89%) @Suppress("NAME_SHADOWING") class Solution { diff --git a/src/main/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.kt b/src/main/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.kt index 06b87ea89..6a1194984 100644 --- a/src/main/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.kt +++ b/src/main/kotlin/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.kt @@ -1,6 +1,6 @@ package g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree -// #Medium #Dynamic_Programming #Depth_First_Search #Tree #Binary_Tree +// #Medium #Dynamic_Programming #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS // #2023_06_06_Time_381_ms_(66.11%)_Space_50.7_MB_(31.89%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.kt b/src/main/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.kt index 25f80a457..62a46ec0d 100644 --- a/src/main/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.kt +++ b/src/main/kotlin/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.kt @@ -1,6 +1,6 @@ package g1401_1500.s1431_kids_with_the_greatest_number_of_candies -// #Easy #Array #2023_06_07_Time_152_ms_(99.61%)_Space_35.5_MB_(90.98%) +// #Easy #Array #LeetCode_75_Array/String #2023_06_07_Time_152_ms_(99.61%)_Space_35.5_MB_(90.98%) class Solution { fun kidsWithCandies(candies: IntArray, extraCandies: Int): List { diff --git a/src/main/kotlin/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.kt b/src/main/kotlin/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.kt index 7d15bf784..39f4f51e0 100644 --- a/src/main/kotlin/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.kt +++ b/src/main/kotlin/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.kt @@ -1,6 +1,6 @@ package g1401_1500.s1448_count_good_nodes_in_binary_tree -// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree +// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS // #2023_06_07_Time_384_ms_(68.52%)_Space_50.5_MB_(68.52%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.kt b/src/main/kotlin/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.kt index ecb567f28..90c9a4e86 100644 --- a/src/main/kotlin/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.kt +++ b/src/main/kotlin/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.kt @@ -1,6 +1,7 @@ package g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length -// #Medium #String #Sliding_Window #2023_06_13_Time_215_ms_(97.25%)_Space_37.7_MB_(97.71%) +// #Medium #String #Sliding_Window #LeetCode_75_Sliding_Window +// #2023_06_13_Time_215_ms_(97.25%)_Space_37.7_MB_(97.71%) class Solution { private fun isVowel(c: Char): Boolean { diff --git a/src/main/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.kt b/src/main/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.kt index 56d82c43c..8648b77db 100644 --- a/src/main/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.kt +++ b/src/main/kotlin/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.kt @@ -1,6 +1,6 @@ package g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero -// #Medium #Depth_First_Search #Breadth_First_Search #Graph +// #Medium #Depth_First_Search #Breadth_First_Search #Graph #LeetCode_75_Graphs/DFS // #Graph_Theory_I_Day_10_Standard_Traversal // #2023_06_13_Time_718_ms_(100.00%)_Space_61.9_MB_(100.00%) diff --git a/src/main/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.kt b/src/main/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.kt index 3b95a8aaa..a67ab66e2 100644 --- a/src/main/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.kt +++ b/src/main/kotlin/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.kt @@ -1,6 +1,6 @@ package g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element -// #Medium #Dynamic_Programming #Math #Sliding_Window +// #Medium #Dynamic_Programming #Math #Sliding_Window #LeetCode_75_Sliding_Window // #2023_06_13_Time_288_ms_(73.85%)_Space_46.3_MB_(70.77%) class Solution { diff --git a/src/main/kotlin/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.kt b/src/main/kotlin/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.kt index dad666802..cf7bb3e2e 100644 --- a/src/main/kotlin/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.kt +++ b/src/main/kotlin/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.kt @@ -1,6 +1,7 @@ package g1601_1700.s1657_determine_if_two_strings_are_close -// #Medium #String #Hash_Table #Sorting #2023_06_15_Time_287_ms_(100.00%)_Space_40.1_MB_(97.06%) +// #Medium #String #Hash_Table #Sorting #LeetCode_75_Hash_Map/Set +// #2023_06_15_Time_287_ms_(100.00%)_Space_40.1_MB_(97.06%) class Solution { fun closeStrings(word1: String, word2: String): Boolean { diff --git a/src/main/kotlin/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.kt b/src/main/kotlin/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.kt index 7e497c4c2..45db56c3d 100644 --- a/src/main/kotlin/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.kt +++ b/src/main/kotlin/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.kt @@ -1,6 +1,6 @@ package g1601_1700.s1679_max_number_of_k_sum_pairs -// #Medium #Array #Hash_Table #Sorting #Two_Pointers +// #Medium #Array #Hash_Table #Sorting #Two_Pointers #LeetCode_75_Two_Pointers // #2023_06_15_Time_468_ms_(92.86%)_Space_50.5_MB_(92.86%) class Solution { diff --git a/src/main/kotlin/g1701_1800/s1732_find_the_highest_altitude/Solution.kt b/src/main/kotlin/g1701_1800/s1732_find_the_highest_altitude/Solution.kt index 4e85393c5..f7ad7c1c6 100644 --- a/src/main/kotlin/g1701_1800/s1732_find_the_highest_altitude/Solution.kt +++ b/src/main/kotlin/g1701_1800/s1732_find_the_highest_altitude/Solution.kt @@ -1,6 +1,7 @@ package g1701_1800.s1732_find_the_highest_altitude -// #Easy #Array #Prefix_Sum #2023_06_16_Time_139_ms_(90.70%)_Space_34.1_MB_(63.95%) +// #Easy #Array #Prefix_Sum #LeetCode_75_Prefix_Sum +// #2023_06_16_Time_139_ms_(90.70%)_Space_34.1_MB_(63.95%) class Solution { fun largestAltitude(gain: IntArray): Int { diff --git a/src/main/kotlin/g1701_1800/s1768_merge_strings_alternately/Solution.kt b/src/main/kotlin/g1701_1800/s1768_merge_strings_alternately/Solution.kt index f7db37a5b..bfc10d432 100644 --- a/src/main/kotlin/g1701_1800/s1768_merge_strings_alternately/Solution.kt +++ b/src/main/kotlin/g1701_1800/s1768_merge_strings_alternately/Solution.kt @@ -1,6 +1,6 @@ package g1701_1800.s1768_merge_strings_alternately -// #Easy #String #Two_Pointers #Programming_Skills_I_Day_8_String +// #Easy #String #Two_Pointers #LeetCode_75_Array/String #Programming_Skills_I_Day_8_String // #2023_06_18_Time_138_ms_(93.81%)_Space_33.8_MB_(97.56%) class Solution { diff --git a/src/main/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.kt b/src/main/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.kt index 5b43e71f7..b9e2973d1 100644 --- a/src/main/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.kt +++ b/src/main/kotlin/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.kt @@ -1,6 +1,7 @@ package g1901_2000.s1926_nearest_exit_from_entrance_in_maze -// #Medium #Array #Breadth_First_Search #Matrix #Graph_Theory_I_Day_6_Matrix_Related_Problems +// #Medium #Array #Breadth_First_Search #Matrix #LeetCode_75_Graphs/BFS +// #Graph_Theory_I_Day_6_Matrix_Related_Problems // #2023_06_20_Time_351_ms_(94.44%)_Space_45.4_MB_(100.00%) import java.util.LinkedList diff --git a/src/main/kotlin/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.kt b/src/main/kotlin/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.kt index 83343e1c7..553a94106 100644 --- a/src/main/kotlin/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.kt +++ b/src/main/kotlin/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.kt @@ -1,6 +1,7 @@ package g2001_2100.s2095_delete_the_middle_node_of_a_linked_list -// #Medium #Two_Pointers #Linked_List #2023_06_28_Time_1115_ms_(50.00%)_Space_61.4_MB_(81.25%) +// #Medium #Two_Pointers #Linked_List #LeetCode_75_LinkedList +// #2023_06_28_Time_1115_ms_(50.00%)_Space_61.4_MB_(81.25%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.kt b/src/main/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.kt index a2f432862..ed7e29c05 100644 --- a/src/main/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.kt +++ b/src/main/kotlin/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.kt @@ -1,6 +1,7 @@ package g2101_2200.s2130_maximum_twin_sum_of_a_linked_list -// #Medium #Two_Pointers #Stack #Linked_List #2023_10_02_Time_458_ms_(93.88%)_Space_61.6_MB_(35.71%) +// #Medium #Two_Pointers #Stack #Linked_List #LeetCode_75_LinkedList +// #2023_10_02_Time_458_ms_(93.88%)_Space_61.6_MB_(35.71%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.kt b/src/main/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.kt index 57e066c4d..428d9e130 100644 --- a/src/main/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.kt +++ b/src/main/kotlin/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.kt @@ -1,6 +1,7 @@ package g2201_2300.s2215_find_the_difference_of_two_arrays -// #Easy #Array #Hash_Table #2023_06_27_Time_352_ms_(98.63%)_Space_41.4_MB_(98.63%) +// #Easy #Array #Hash_Table #LeetCode_75_Hash_Map/Set +// #2023_06_27_Time_352_ms_(98.63%)_Space_41.4_MB_(98.63%) class Solution { fun findDifference(nums1: IntArray, nums2: IntArray): List> { diff --git a/src/main/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.kt b/src/main/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.kt index a91fc3c0c..18f9ff30a 100644 --- a/src/main/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.kt +++ b/src/main/kotlin/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.kt @@ -1,6 +1,6 @@ package g2201_2300.s2300_successful_pairs_of_spells_and_potions -// #Medium #Array #Sorting #Binary_Search #Two_Pointers +// #Medium #Array #Sorting #Binary_Search #Two_Pointers #LeetCode_75_Binary_Search // #2023_06_28_Time_818_ms_(72.22%)_Space_62.9_MB_(44.44%) class Solution { diff --git a/src/main/kotlin/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.kt b/src/main/kotlin/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.kt index 05ee76627..362c0fceb 100644 --- a/src/main/kotlin/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.kt +++ b/src/main/kotlin/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.kt @@ -1,6 +1,6 @@ package g2301_2400.s2336_smallest_number_in_infinite_set -// #Medium #Hash_Table #Design #Heap_Priority_Queue +// #Medium #Hash_Table #Design #Heap_Priority_Queue #LeetCode_75_Heap/Priority_Queue // #2023_07_01_Time_308_ms_(95.45%)_Space_45.1_MB_(79.55%) class SmallestInfiniteSet { diff --git a/src/main/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/Solution.kt b/src/main/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/Solution.kt index fb90c144f..f22bebc9c 100644 --- a/src/main/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/Solution.kt +++ b/src/main/kotlin/g2301_2400/s2352_equal_row_and_column_pairs/Solution.kt @@ -1,6 +1,6 @@ package g2301_2400.s2352_equal_row_and_column_pairs -// #Medium #Array #Hash_Table #Matrix #Simulation +// #Medium #Array #Hash_Table #Matrix #Simulation #LeetCode_75_Hash_Map/Set // #2023_07_02_Time_339_ms_(100.00%)_Space_48.6_MB_(96.25%) class Solution { diff --git a/src/main/kotlin/g2301_2400/s2390_removing_stars_from_a_string/Solution.kt b/src/main/kotlin/g2301_2400/s2390_removing_stars_from_a_string/Solution.kt index c212d36c2..3cb5778bd 100644 --- a/src/main/kotlin/g2301_2400/s2390_removing_stars_from_a_string/Solution.kt +++ b/src/main/kotlin/g2301_2400/s2390_removing_stars_from_a_string/Solution.kt @@ -1,6 +1,7 @@ package g2301_2400.s2390_removing_stars_from_a_string -// #Medium #String #Stack #Simulation #2023_07_02_Time_337_ms_(62.92%)_Space_39.3_MB_(88.76%) +// #Medium #String #Stack #Simulation #LeetCode_75_Stack +// #2023_07_02_Time_337_ms_(62.92%)_Space_39.3_MB_(88.76%) class Solution { fun removeStars(s: String): String { diff --git a/src/main/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.kt b/src/main/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.kt index fa5f2b8f8..af48ebe40 100644 --- a/src/main/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.kt +++ b/src/main/kotlin/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.kt @@ -1,6 +1,6 @@ package g2401_2500.s2462_total_cost_to_hire_k_workers -// #Medium #Array #Two_Pointers #Heap_Priority_Queue #Simulation +// #Medium #Array #Two_Pointers #Heap_Priority_Queue #Simulation #LeetCode_75_Heap/Priority_Queue // #2023_07_05_Time_588_ms_(81.43%)_Space_61.5_MB_(41.43%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g2501_2600/s2542_maximum_subsequence_score/Solution.kt b/src/main/kotlin/g2501_2600/s2542_maximum_subsequence_score/Solution.kt index 3b59b073b..19b65e518 100644 --- a/src/main/kotlin/g2501_2600/s2542_maximum_subsequence_score/Solution.kt +++ b/src/main/kotlin/g2501_2600/s2542_maximum_subsequence_score/Solution.kt @@ -1,6 +1,6 @@ package g2501_2600.s2542_maximum_subsequence_score -// #Medium #Array #Sorting #Greedy #Heap_Priority_Queue +// #Medium #Array #Sorting #Greedy #Heap_Priority_Queue #LeetCode_75_Heap/Priority_Queue // #2023_07_04_Time_780_ms_(81.97%)_Space_56.7_MB_(99.45%) import java.util.PriorityQueue