diff --git a/README.md b/README.md index c6fa99b2e..42cfcbfc5 100644 --- a/README.md +++ b/README.md @@ -57,7 +57,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 0 | 100.00 -| 0374 |[Guess Number Higher or Lower](src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java)| Easy | Binary_Search, Interactive | 0 | 100.00 +| 0374 |[Guess Number Higher or Lower](src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java)| Easy | Binary_Search, Interactive, LeetCode_75_Binary_Search | 0 | 100.00 #### Day 2 @@ -162,7 +162,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0875 |[Koko Eating Bananas](src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java)| Medium | Array, Binary_Search | 15 | 91.32 +| 0875 |[Koko Eating Bananas](src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java)| Medium | Array, Binary_Search, LeetCode_75_Binary_Search | 15 | 91.32 | 1552 |[Magnetic Force Between Two Balls](src/main/java/g1501_1600/s1552_magnetic_force_between_two_balls/Solution.java)| Medium | Array, Sorting, Binary_Search | 39 | 99.65 #### Day 5 @@ -219,7 +219,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0081 |[Search in Rotated Sorted Array II](src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii/Solution.java)| Medium | Array, Binary_Search | 1 | 82.83 -| 0162 |[Find Peak Element](src/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search | 0 | 100.00 +| 0162 |[Find Peak Element](src/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 0 | 100.00 #### Day 13 @@ -284,20 +284,20 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0509 |[Fibonacci Number](src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java)| Easy | Dynamic_Programming, Math, Recursion, Memoization | 0 | 100.00 -| 1137 |[N-th Tribonacci Number](src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java)| Easy | Dynamic_Programming, Math, Memoization | 0 | 100.00 +| 1137 |[N-th Tribonacci Number](src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java)| Easy | Dynamic_Programming, Math, Memoization, LeetCode_75_DP/1D | 0 | 100.00 #### Day 2 | | | | | | |-|-|-|-|-|- | 0070 |[Climbing Stairs](src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -| 0746 |[Min Cost Climbing Stairs](src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java)| Easy | Array, Dynamic_Programming | 1 | 86.38 +| 0746 |[Min Cost Climbing Stairs](src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java)| Easy | Array, Dynamic_Programming, LeetCode_75_DP/1D | 1 | 86.38 #### Day 3 | | | | | | |-|-|-|-|-|- -| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0213 |[House Robber II](src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java)| Medium | Array, Dynamic_Programming | 0 | 100.00 | 0740 |[Delete and Earn](src/main/java/g0701_0800/s0740_delete_and_earn/Solution.java)| Medium | Array, Hash_Table, Dynamic_Programming | 4 | 77.68 @@ -335,7 +335,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0309 |[Best Time to Buy and Sell Stock with Cooldown](src/main/java/g0301_0400/s0309_best_time_to_buy_and_sell_stock_with_cooldown/Solution.java)| Medium | Array, Dynamic_Programming | 0 | 100.00 -| 0714 |[Best Time to Buy and Sell Stock with Transaction Fee](src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java)| Medium | Array, Dynamic_Programming, Greedy | 4 | 78.57 +| 0714 |[Best Time to Buy and Sell Stock with Transaction Fee](src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java)| Medium | Array, Dynamic_Programming, Greedy, LeetCode_75_DP/Multidimensional | 4 | 78.57 #### Day 9 @@ -383,7 +383,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0062 |[Unique Paths](src/main/java/g0001_0100/s0062_unique_paths/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 +| 0062 |[Unique Paths](src/main/java/g0001_0100/s0062_unique_paths/Solution.java)| 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) | 0 | 100.00 | 0063 |[Unique Paths II](src/main/java/g0001_0100/s0063_unique_paths_ii/Solution.java)| Medium | Array, Dynamic_Programming, Matrix | 0 | 100.00 #### Day 16 @@ -411,9 +411,9 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers | 1 | 93.13 -| 1143 |[Longest Common Subsequence](src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 -| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 1 | 93.13 +| 1143 |[Longest Common Subsequence](src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 +| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 #### Day 20 @@ -475,7 +475,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 1588 |[Sum of All Odd Length Subarrays](src/main/java/g1501_1600/s1588_sum_of_all_odd_length_subarrays/Solution.java)| Easy | Array, Math, Prefix_Sum | 0 | 100.00 -| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 +| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 | 1672 |[Richest Customer Wealth](src/main/java/g1601_1700/s1672_richest_customer_wealth/Solution.java)| Easy | Array, Matrix | 0 | 100.00 #### Day 7 Array @@ -489,7 +489,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 1768 |[Merge Strings Alternately](src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java)| Easy | String, Two_Pointers | 1 | 86.26 +| 1768 |[Merge Strings Alternately](src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java)| Easy | String, Two_Pointers, LeetCode_75_Array/String | 1 | 86.26 | 1678 |[Goal Parser Interpretation](src/main/java/g1601_1700/s1678_goal_parser_interpretation/Solution.java)| Easy | String | 0 | 100.00 | 0389 |[Find the Difference](src/main/java/g0301_0400/s0389_find_the_difference/Solution.java)| Easy | String, Hash_Table, Sorting, Bit_Manipulation | 1 | 100.00 @@ -507,7 +507,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 1290 |[Convert Binary Number in a Linked List to Integer](src/main/java/g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer/Solution.java)| Easy | Math, Linked_List | 0 | 100.00 | 0876 |[Middle of the Linked List](src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java)| Easy | Two_Pointers, Linked_List | 0 | 100.00 -| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 +| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 | 0404 |[Sum of Left Leaves](src/main/java/g0401_0500/s0404_sum_of_left_leaves/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 29.26 #### Day 11 Containers and Libraries @@ -567,7 +567,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0739 |[Daily Temperatures](src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83 +| 0739 |[Daily Temperatures](src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83 | 0058 |[Length of Last Word](src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java)| Easy | String | 0 | 100.00 #### Day 7 @@ -711,20 +711,20 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0934 |[Shortest Bridge](src/main/java/g0901_1000/s0934_shortest_bridge/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 6 | 97.87 -| 1926 |[Nearest Exit from Entrance in Maze](src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 12 | 40.55 +| 1926 |[Nearest Exit from Entrance in Maze](src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java)| Medium | Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 12 | 40.55 #### Day 7 Standard Traversal | | | | | | |-|-|-|-|-|- | 0797 |[All Paths From Source to Target](src/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking | 2 | 90.53 -| 0841 |[Keys and Rooms](src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 3 | 51.54 +| 0841 |[Keys and Rooms](src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 3 | 51.54 #### Day 8 Standard Traversal | | | | | | |-|-|-|-|-|- -| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51 +| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 2 | 69.51 | 1319 |[Number of Operations to Make Network Connected](src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 9 | 67.64 #### Day 9 Standard Traversal @@ -739,7 +739,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 1129 |[Shortest Path with Alternating Colors](src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.java)| Medium | Breadth_First_Search, Graph | 4 | 96.63 -| 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 39 | 97.71 +| 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 39 | 97.71 | 0847 |[Shortest Path Visiting All Nodes](src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.java)| Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask | 14 | 78.72 #### Day 11 Breadth First Search @@ -865,21 +865,21 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 1480 |[Running Sum of 1d Array](src/main/java/g1401_1500/s1480_running_sum_of_1d_array/Solution.java)| Easy | Array, Prefix_Sum | 0 | 100.00 -| 0724 |[Find Pivot Index](src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java)| Easy | Array, Prefix_Sum | 2 | 69.67 +| 0724 |[Find Pivot Index](src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java)| Easy | Array, Prefix_Sum, LeetCode_75_Prefix_Sum | 2 | 69.67 #### Day 2 String | | | | | | |-|-|-|-|-|- | 0205 |[Isomorphic Strings](src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java)| Easy | String, Hash_Table | 2 | 99.18 -| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers | 1 | 93.13 +| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 1 | 93.13 #### Day 3 Linked List | | | | | | |-|-|-|-|-|- | 0021 |[Merge Two Sorted Lists](src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 -| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 #### Day 4 Linked List @@ -934,8 +934,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0746 |[Min Cost Climbing Stairs](src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java)| Easy | Array, Dynamic_Programming | 1 | 86.38 -| 0062 |[Unique Paths](src/main/java/g0001_0100/s0062_unique_paths/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 +| 0746 |[Min Cost Climbing Stairs](src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java)| Easy | Array, Dynamic_Programming, LeetCode_75_DP/1D | 1 | 86.38 +| 0062 |[Unique Paths](src/main/java/g0001_0100/s0062_unique_paths/Solution.java)| 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) | 0 | 100.00 #### Day 12 Sliding Window/Two Pointer @@ -956,7 +956,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0844 |[Backspace String Compare](src/main/java/g0801_0900/s0844_backspace_string_compare/Solution.java)| Easy | String, Two_Pointers, Stack, Simulation | 0 | 100.00 -| 0394 |[Decode String](src/main/java/g0301_0400/s0394_decode_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0394 |[Decode String](src/main/java/g0301_0400/s0394_decode_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 #### Day 15 Heap @@ -993,7 +993,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0328 |[Odd Even Linked List](src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java)| Medium | Linked_List | 0 | 100.00 +| 0328 |[Odd Even Linked List](src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java)| Medium | Linked_List, LeetCode_75_LinkedList | 0 | 100.00 | 0148 |[Sort List](src/main/java/g0101_0200/s0148_sort_list/Solution.java)| 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)) | 9 | 93.90 #### Day 5 Greedy @@ -1015,7 +1015,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0543 |[Diameter of Binary Tree](src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -| 0437 |[Path Sum III](src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 +| 0437 |[Path Sum III](src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 #### Day 8 Binary Search @@ -1036,7 +1036,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0994 |[Rotting Oranges](src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix | 3 | 74.27 +| 0994 |[Rotting Oranges](src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 3 | 74.27 | 0417 |[Pacific Atlantic Water Flow](src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 5 | 92.62 #### Day 11 Graph/BFS/DFS @@ -1050,7 +1050,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0322 |[Coin Change](src/main/java/g0301_0400/s0322_coin_change/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 12 | 92.59 #### Day 13 Dynamic Programming @@ -1074,7 +1074,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 0100 |[Same Tree](src/main/java/g0001_0100/s0100_same_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 | 0101 |[Symmetric Tree](src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java)| 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)) | 0 | 100.00 -| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 +| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 0 | 100.00 #### Day 16 Design @@ -1082,7 +1082,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 0232 |[Implement Queue using Stacks](src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java)| Easy | Stack, Design, Queue | 1 | 67.21 | 0155 |[Min Stack](src/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 4 | 96.54 -| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| 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) | 32 | 95.05 +| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| 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) | 32 | 95.05 #### Day 17 Interval @@ -1095,14 +1095,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0735 |[Asteroid Collision](src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java)| Medium | Array, Stack | 2 | 99.59 +| 0735 |[Asteroid Collision](src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java)| Medium | Array, Stack, LeetCode_75_Stack | 2 | 99.59 | 0227 |[Basic Calculator II](src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java)| Medium | String, Math, Stack | 8 | 95.32 #### Day 19 Union Find | | | | | | |-|-|-|-|-|- -| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51 +| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 2 | 69.51 | 0947 |[Most Stones Removed with Same Row or Column](src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column/Solution.java)| Medium | Depth_First_Search, Graph, Union_Find | 7 | 98.83 #### Day 20 Brute Force/Backtracking @@ -1119,7 +1119,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0412 |[Fizz Buzz](src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java)| Easy | String, Math, Simulation | 1 | 100.00 -| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 | 0007 |[Reverse Integer](src/main/java/g0001_0100/s0007_reverse_integer/Solution.java)| Medium | Top_Interview_Questions, Math | 0 | 100.00 | 0009 |[Palindrome Number](src/main/java/g0001_0100/s0009_palindrome_number/Solution.java)| Easy | Math | 4 | 100.00 | 0172 |[Factorial Trailing Zeroes](src/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java)| Medium | Top_Interview_Questions, Math | 0 | 100.00 @@ -1135,10 +1135,10 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0003 |[Longest Substring Without Repeating Characters](src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59 | 0020 |[Valid Parentheses](src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 2 | 97.19 | 0005 |[Longest Palindromic Substring](src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 7 | 97.82 -| 0394 |[Decode String](src/main/java/g0301_0400/s0394_decode_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0394 |[Decode String](src/main/java/g0301_0400/s0394_decode_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0242 |[Valid Anagram](src/main/java/g0201_0300/s0242_valid_anagram/Solution.java)| Easy | String, Hash_Table, Sorting | 2 | 97.76 | 0049 |[Group Anagrams](src/main/java/g0001_0100/s0049_group_anagrams/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 6 | 97.61 -| 0151 |[Reverse Words in a String](src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java)| Medium | String, Two_Pointers | 2 | 99.69 +| 0151 |[Reverse Words in a String](src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java)| Medium | String, Two_Pointers, LeetCode_75_Array/String | 2 | 99.69 | 0273 |[Integer to English Words](src/main/java/g0201_0300/s0273_integer_to_english_words/Solution.java)| Hard | String, Math, Recursion | 3 | 95.67 #### Udemy Binary Search @@ -1154,18 +1154,18 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0121 |[Best Time to Buy and Sell Stock](src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 99.78 -| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 +| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 | 0001 |[Two Sum](src/main/java/g0001_0100/s0001_two_sum/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 2 | 98.90 | 0217 |[Contains Duplicate](src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 6 | 96.68 | 0058 |[Length of Last Word](src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java)| Easy | String | 0 | 100.00 -| 0605 |[Can Place Flowers](src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java)| Easy | Array, Greedy | 1 | 96.77 +| 0605 |[Can Place Flowers](src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java)| Easy | Array, Greedy, LeetCode_75_Array/String | 1 | 96.77 | 0122 |[Best Time to Buy and Sell Stock II](src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.java)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 1 | 76.91 | 0080 |[Remove Duplicates from Sorted Array II](src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.java)| Medium | Array, Two_Pointers | 0 | 100.00 | 0189 |[Rotate Array](src/main/java/g0101_0200/s0189_rotate_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0055 |[Jump Game](src/main/java/g0001_0100/s0055_jump_game/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 | 0075 |[Sort Colors](src/main/java/g0001_0100/s0075_sort_colors/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0066 |[Plus One](src/main/java/g0001_0100/s0066_plus_one/Solution.java)| Easy | Top_Interview_Questions, Array, Math | 0 | 100.00 -| 0238 |[Product of Array Except Self](src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 +| 0238 |[Product of Array Except Self](src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 | 1291 |[Sequential Digits](src/main/java/g1201_1300/s1291_sequential_digits/Solution.java)| Medium | Enumeration | 0 | 100.00 | 0448 |[Find All Numbers Disappeared in an Array](src/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.java)| Easy | Array, Hash_Table | 3 | 100.00 | 0442 |[Find All Duplicates in an Array](src/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.java)| Medium | Array, Hash_Table | 5 | 98.83 @@ -1182,7 +1182,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers | 1 | 93.13 +| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 1 | 93.13 | 0125 |[Valid Palindrome](src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers | 2 | 99.11 | 0977 |[Squares of a Sorted Array](src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java)| Easy | Array, Sorting, Two_Pointers | 1 | 100.00 | 0026 |[Remove Duplicates from Sorted Array](src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java)| Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00 @@ -1220,13 +1220,13 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 0114 |[Flatten Binary Tree to Linked List](src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0445 |[Add Two Numbers II](src/main/java/g0401_0500/s0445_add_two_numbers_ii/Solution.java)| Medium | Math, Stack, Linked_List | 3 | 90.38 -| 0328 |[Odd Even Linked List](src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java)| Medium | Linked_List | 0 | 100.00 +| 0328 |[Odd Even Linked List](src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java)| Medium | Linked_List, LeetCode_75_LinkedList | 0 | 100.00 | 0061 |[Rotate List](src/main/java/g0001_0100/s0061_rotate_list/Solution.java)| Medium | Two_Pointers, Linked_List | 0 | 100.00 | 0024 |[Swap Nodes in Pairs](src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0876 |[Middle of the Linked List](src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java)| Easy | Two_Pointers, Linked_List | 0 | 100.00 | 0142 |[Linked List Cycle II](src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 | 0141 |[Linked List Cycle](src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 -| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 | 0021 |[Merge Two Sorted Lists](src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 | 0160 |[Intersection of Two Linked Lists](src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 1 | 99.92 | 0234 |[Palindrome Linked List](src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 4 | 84.46 @@ -1251,21 +1251,21 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0100 |[Same Tree](src/main/java/g0001_0100/s0100_same_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 | 0226 |[Invert Binary Tree](src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0111 |[Minimum Depth of Binary Tree](src/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 97.49 -| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 +| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 | 0110 |[Balanced Binary Tree](src/main/java/g0101_0200/s0110_balanced_binary_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree | 1 | 98.82 | 0701 |[Insert into a Binary Search Tree](src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.java)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 | 0297 |[Serialize and Deserialize Binary Tree](src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java)| Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 7 | 98.13 | 0124 |[Binary Tree Maximum Path Sum](src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0098 |[Validate Binary Search Tree](src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java)| 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)) | 0 | 100.00 | 0337 |[House Robber III](src/main/java/g0301_0400/s0337_house_robber_iii/Solution.java)| Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 1 | 91.77 -| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 | 0968 |[Binary Tree Cameras](src/main/java/g0901_1000/s0968_binary_tree_cameras/Solution.java)| Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 0 | 100.00 #### Udemy Trie and Heap | | | | | | |-|-|-|-|-|- -| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| 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) | 32 | 95.05 +| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| 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) | 32 | 95.05 | 0745 |[Prefix and Suffix Search](src/main/java/g0701_0800/s0745_prefix_and_suffix_search/WordFilter.java)| Hard | String, Design, Trie | 366 | 76.15 #### Udemy Graph @@ -1285,14 +1285,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0119 |[Pascal's Triangle II](src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java)| Easy | Array, Dynamic_Programming | 0 | 100.00 | 0139 |[Word Break](src/main/java/g0101_0200/s0139_word_break/Solution.java)| 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) | 1 | 99.42 | 0152 |[Maximum Product Subarray](src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 92.74 -| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0213 |[House Robber II](src/main/java/g0201_0300/s0213_house_robber_ii/Solution.java)| Medium | Array, Dynamic_Programming | 0 | 100.00 | 0509 |[Fibonacci Number](src/main/java/g0501_0600/s0509_fibonacci_number/Solution.java)| Easy | Dynamic_Programming, Math, Recursion, Memoization | 0 | 100.00 | 0070 |[Climbing Stairs](src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0064 |[Minimum Path Sum](src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 1 | 99.73 | 0300 |[Longest Increasing Subsequence](src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 3 | 95.75 -| 1143 |[Longest Common Subsequence](src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 -| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 1143 |[Longest Common Subsequence](src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 +| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 | 0044 |[Wildcard Matching](src/main/java/g0001_0100/s0044_wildcard_matching/Solution.java)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion | 2 | 99.87 | 0010 |[Regular Expression Matching](src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 1 | 100.00 @@ -1302,9 +1302,9 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 0022 |[Generate Parentheses](src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00 | 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99 -| 0216 |[Combination Sum III](src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java)| Medium | Array, Backtracking | 1 | 81.35 +| 0216 |[Combination Sum III](src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java)| Medium | Array, Backtracking, LeetCode_75_Backtracking | 1 | 81.35 | 0078 |[Subsets](src/main/java/g0001_0100/s0078_subsets/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 0 | 100.00 -| 0017 |[Letter Combinations of a Phone Number](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 +| 0017 |[Letter Combinations of a Phone Number](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 | 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 | 94.08 #### Udemy Bit Manipulation @@ -1316,7 +1316,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 0 | 100.00 | 0461 |[Hamming Distance](src/main/java/g0401_0500/s0461_hamming_distance/Solution.java)| Easy | Bit_Manipulation | 0 | 100.00 | 1009 |[Complement of Base 10 Integer](src/main/java/g1001_1100/s1009_complement_of_base_10_integer/Solution.java)| Easy | Bit_Manipulation | 1 | 41.56 -| 0338 |[Counting Bits](src/main/java/g0301_0400/s0338_counting_bits/Solution.java)| Easy | Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 +| 0338 |[Counting Bits](src/main/java/g0301_0400/s0338_counting_bits/Solution.java)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 | 0371 |[Sum of Two Integers](src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java)| Medium | Math, Bit_Manipulation | 0 | 100.00 | 0029 |[Divide Two Integers](src/main/java/g0001_0100/s0029_divide_two_integers/Solution.java)| Medium | Top_Interview_Questions, Math, Bit_Manipulation | 1 | 97.44 @@ -1344,7 +1344,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0045 |[Jump Game II](src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0274 |[H-Index](src/main/java/g0201_0300/s0274_h_index/Solution.java)| Medium | Array, Sorting, Counting_Sort | 0 | 100.00 | 0380 |[Insert Delete GetRandom O(1)](src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java)| Medium | Array, Hash_Table, Math, Design, Randomized | 27 | 93.44 -| 0238 |[Product of Array Except Self](src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 +| 0238 |[Product of Array Except Self](src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 | 0134 |[Gas Station](src/main/java/g0101_0200/s0134_gas_station/Solution.java)| Medium | Top_Interview_Questions, Array, Greedy | 2 | 97.52 | 0135 |[Candy](src/main/java/g0101_0200/s0135_candy/Solution.java)| Hard | Array, Greedy | 3 | 83.95 | 0042 |[Trapping Rain Water](src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 @@ -1352,7 +1352,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0012 |[Integer to Roman](src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java)| Medium | String, Hash_Table, Math | 2 | 100.00 | 0058 |[Length of Last Word](src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java)| Easy | String | 0 | 100.00 | 0014 |[Longest Common Prefix](src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String | 0 | 100.00 -| 0151 |[Reverse Words in a String](src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java)| Medium | String, Two_Pointers | 2 | 99.69 +| 0151 |[Reverse Words in a String](src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java)| Medium | String, Two_Pointers, LeetCode_75_Array/String | 2 | 99.69 | 0006 |[Zigzag Conversion](src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java)| Medium | String | 2 | 99.71 | 0028 |[Implement strStr()](src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching | 0 | 100.00 | 0068 |[Text Justification](src/main/java/g0001_0100/s0068_text_justification/Solution.java)| Hard | Array, String, Simulation | 0 | 100.00 @@ -1362,9 +1362,9 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0125 |[Valid Palindrome](src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers | 2 | 99.11 -| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers | 1 | 93.13 +| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers, LeetCode_75_Two_Pointers | 1 | 93.13 | 0167 |[Two Sum II - Input Array Is Sorted](src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers | 2 | 92.62 -| 0011 |[Container With Most Water](src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 +| 0011 |[Container With Most Water](src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 | 0015 |[3Sum](src/main/java/g0001_0100/s0015_3sum/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 29 | 72.02 #### Top Interview 150 Sliding Window @@ -1407,7 +1407,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0228 |[Summary Ranges](src/main/java/g0201_0300/s0228_summary_ranges/Solution.java)| Easy | Array | 0 | 100.00 | 0056 |[Merge Intervals](src/main/java/g0001_0100/s0056_merge_intervals/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 | 0057 |[Insert Interval](src/main/java/g0001_0100/s0057_insert_interval/Solution.java)| Medium | Array | 0 | 100.00 -| 0452 |[Minimum Number of Arrows to Burst Balloons](src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java)| Medium | Array, Sorting, Greedy | 52 | 89.91 +| 0452 |[Minimum Number of Arrows to Burst Balloons](src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java)| Medium | Array, Sorting, Greedy, LeetCode_75_Intervals | 52 | 89.91 #### Top Interview 150 Stack @@ -1439,7 +1439,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 +| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 | 0100 |[Same Tree](src/main/java/g0001_0100/s0100_same_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 | 0226 |[Invert Binary Tree](src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0101 |[Symmetric Tree](src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java)| 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)) | 0 | 100.00 @@ -1452,13 +1452,13 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0124 |[Binary Tree Maximum Path Sum](src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0173 |[Binary Search Tree Iterator](src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java)| Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 15 | 100.00 | 0222 |[Count Complete Tree Nodes](src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Search, Binary_Tree | 0 | 100.00 -| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 #### Top Interview 150 Binary Tree BFS | | | | | | |-|-|-|-|-|- -| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 +| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 0 | 100.00 | 0637 |[Average of Levels in Binary Tree](src/main/java/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.java)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 2 | 94.34 | 0102 |[Binary Tree Level Order Traversal](src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 91.19 | 0103 |[Binary Tree Zigzag Level Order Traversal](src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.java)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 @@ -1478,7 +1478,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 | 0130 |[Surrounded Regions](src/main/java/g0101_0200/s0130_surrounded_regions/Solution.java)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 2 | 84.66 | 0133 |[Clone Graph](src/main/java/g0101_0200/s0133_clone_graph/Solution.java)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 45 | 29.80 -| 0399 |[Evaluate Division](src/main/java/g0301_0400/s0399_evaluate_division/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Shortest_Path | 1 | 99.52 +| 0399 |[Evaluate Division](src/main/java/g0301_0400/s0399_evaluate_division/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Shortest_Path, LeetCode_75_Graphs/DFS | 1 | 99.52 | 0207 |[Course Schedule](src/main/java/g0201_0300/s0207_course_schedule/Solution.java)| 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) | 3 | 99.99 | 0210 |[Course Schedule II](src/main/java/g0201_0300/s0210_course_schedule_ii/Solution.java)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 4 | 91.07 @@ -1494,7 +1494,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| 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) | 32 | 95.05 +| 0208 |[Implement Trie (Prefix Tree)](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java)| 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) | 32 | 95.05 | 0211 |[Design Add and Search Words Data Structure](src/main/java/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.java)| Medium | String, Depth_First_Search, Design, Trie | 156 | 99.85 | 0212 |[Word Search II](src/main/java/g0201_0300/s0212_word_search_ii/Solution.java)| Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie | 17 | 99.16 @@ -1502,7 +1502,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0017 |[Letter Combinations of a Phone Number](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 +| 0017 |[Letter Combinations of a Phone Number](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 | 0077 |[Combinations](src/main/java/g0001_0100/s0077_combinations/Solution.java)| Medium | Backtracking | 15 | 92.38 | 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 | 94.08 | 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99 @@ -1532,7 +1532,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 0035 |[Search Insert Position](src/main/java/g0001_0100/s0035_search_insert_position/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 | 0074 |[Search a 2D Matrix](src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -| 0162 |[Find Peak Element](src/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search | 0 | 100.00 +| 0162 |[Find Peak Element](src/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 0 | 100.00 | 0033 |[Search in Rotated Sorted Array](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 | 0034 |[Find First and Last Position of Element in Sorted Array](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 | 0153 |[Find Minimum in Rotated Sorted Array](src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00 @@ -1542,7 +1542,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0215 |[Kth Largest Element in an Array](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java)| 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)) | 5 | 70.82 +| 0215 |[Kth Largest Element in an Array](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java)| 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)) | 5 | 70.82 | 0502 |[IPO](src/main/java/g0501_0600/s0502_ipo/Solution.java)| Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 64 | 97.22 | 0373 |[Find K Pairs with Smallest Sums](src/main/java/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.java)| Medium | Array, Heap_Priority_Queue | 27 | 90.23 | 0295 |[Find Median from Data Stream](src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 83 | 99.56 @@ -1554,7 +1554,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0067 |[Add Binary](src/main/java/g0001_0100/s0067_add_binary/Solution.java)| Easy | String, Math, Bit_Manipulation, Simulation | 1 | 99.82 | 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 0 | 100.00 | 0191 |[Number of 1 Bits](src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00 -| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 | 0137 |[Single Number II](src/main/java/g0101_0200/s0137_single_number_ii/Solution.java)| Medium | Array, Bit_Manipulation | 0 | 100.00 | 0201 |[Bitwise AND of Numbers Range](src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java)| Medium | Bit_Manipulation | 3 | 100.00 @@ -1574,7 +1574,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0070 |[Climbing Stairs](src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0139 |[Word Break](src/main/java/g0101_0200/s0139_word_break/Solution.java)| 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) | 1 | 99.42 | 0322 |[Coin Change](src/main/java/g0301_0400/s0322_coin_change/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 12 | 92.59 | 0300 |[Longest Increasing Subsequence](src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 3 | 95.75 @@ -1588,7 +1588,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | 0063 |[Unique Paths II](src/main/java/g0001_0100/s0063_unique_paths_ii/Solution.java)| Medium | Array, Dynamic_Programming, Matrix | 0 | 100.00 | 0005 |[Longest Palindromic Substring](src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 7 | 97.82 | 0097 |[Interleaving String](src/main/java/g0001_0100/s0097_interleaving_string/Solution.java)| Medium | String, Dynamic_Programming | 0 | 100.00 -| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 | 0123 |[Best Time to Buy and Sell Stock III](src/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.java)| Hard | Array, Dynamic_Programming | 4 | 74.67 | 0188 |[Best Time to Buy and Sell Stock IV](src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.java)| Hard | Array, Dynamic_Programming | 1 | 99.73 | 0221 |[Maximal Square](src/main/java/g0201_0300/s0221_maximal_square/Solution.java)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 6 | 97.07 @@ -1650,7 +1650,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 | 0083 |[Remove Duplicates from Sorted List](src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list/Solution.java)| Easy | Linked_List | 0 | 100.00 #### Day 9 Stack Queue @@ -1673,7 +1673,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0102 |[Binary Tree Level Order Traversal](src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 91.19 -| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 +| 0104 |[Maximum Depth of Binary Tree](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java)| 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) | 0 | 100.00 | 0101 |[Symmetric Tree](src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java)| 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)) | 0 | 100.00 #### Day 12 Tree @@ -1687,7 +1687,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0700 |[Search in a Binary Search Tree](src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java)| Easy | Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 +| 0700 |[Search in a Binary Search Tree](src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java)| Easy | Tree, Binary_Tree, Binary_Search_Tree, LeetCode_75_Binary_Search_Tree | 0 | 100.00 | 0701 |[Insert into a Binary Search Tree](src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.java)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 #### Day 14 Tree @@ -1704,7 +1704,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 | 0169 |[Majority Element](src/main/java/g0101_0200/s0169_majority_element/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 99.89 | 0015 |[3Sum](src/main/java/g0001_0100/s0015_3sum/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 29 | 72.02 @@ -1729,14 +1729,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0240 |[Search a 2D Matrix II](src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 5 | 99.92 -| 0435 |[Non-overlapping Intervals](src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java)| Medium | Array, Dynamic_Programming, Sorting, Greedy | 96 | 47.37 +| 0435 |[Non-overlapping Intervals](src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java)| Medium | Array, Dynamic_Programming, Sorting, Greedy, LeetCode_75_Intervals | 96 | 47.37 #### Day 5 Array | | | | | | |-|-|-|-|-|- -| 0334 |[Increasing Triplet Subsequence](src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java)| Medium | Array, Greedy | 2 | 99.33 -| 0238 |[Product of Array Except Self](src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 +| 0334 |[Increasing Triplet Subsequence](src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java)| Medium | Array, Greedy, LeetCode_75_Array/String | 2 | 99.33 +| 0238 |[Product of Array Except Self](src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 | 0560 |[Subarray Sum Equals K](src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 22 | 95.17 #### Day 6 String @@ -1815,9 +1815,9 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00 +| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 0 | 100.00 | 0113 |[Path Sum II](src/main/java/g0101_0200/s0113_path_sum_ii/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking | 1 | 100.00 -| 0450 |[Delete Node in a BST](src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 0 | 100.00 +| 0450 |[Delete Node in a BST](src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java)| Medium | Tree, Binary_Tree, Binary_Search_Tree, LeetCode_75_Binary_Search_Tree | 0 | 100.00 #### Day 17 Tree @@ -1830,7 +1830,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 | 0297 |[Serialize and Deserialize Binary Tree](src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java)| Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 7 | 98.13 #### Day 19 Graph @@ -1839,13 +1839,13 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 0997 |[Find the Town Judge](src/main/java/g0901_1000/s0997_find_the_town_judge/Solution.java)| Easy | Array, Hash_Table, Graph | 3 | 80.64 | 1557 |[Minimum Number of Vertices to Reach All Nodes](src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.java)| Medium | Graph | 8 | 99.94 -| 0841 |[Keys and Rooms](src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 3 | 51.54 +| 0841 |[Keys and Rooms](src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, LeetCode_75_Graphs/DFS | 3 | 51.54 #### Day 20 Heap Priority Queue | | | | | | |-|-|-|-|-|- -| 0215 |[Kth Largest Element in an Array](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java)| 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)) | 5 | 70.82 +| 0215 |[Kth Largest Element in an Array](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java)| 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)) | 5 | 70.82 | 0347 |[Top K Frequent Elements](src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java)| 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) | 9 | 97.30 #### Day 21 Heap Priority Queue @@ -1876,7 +1876,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 +| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 | 0167 |[Two Sum II - Input Array Is Sorted](src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java)| Medium | Array, Binary_Search, Two_Pointers | 2 | 92.62 #### Day 4 Two Pointers @@ -1919,14 +1919,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83 -| 0994 |[Rotting Oranges](src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix | 3 | 74.27 +| 0994 |[Rotting Oranges](src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix, LeetCode_75_Graphs/BFS | 3 | 74.27 #### Day 10 Recursion Backtracking | | | | | | |-|-|-|-|-|- | 0021 |[Merge Two Sorted Lists](src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 -| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |[Reverse Linked List](src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 #### Day 11 Recursion Backtracking @@ -1941,7 +1941,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0070 |[Climbing Stairs](src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |[House Robber](src/main/java/g0101_0200/s0198_house_robber/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0120 |[Triangle](src/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming | 1 | 99.79 #### Day 13 Bit Manipulation @@ -1956,7 +1956,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 0 | 100.00 -| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |[Single Number](src/main/java/g0101_0200/s0136_single_number/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 ### Algorithm II @@ -1973,7 +1973,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0153 |[Find Minimum in Rotated Sorted Array](src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00 -| 0162 |[Find Peak Element](src/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search | 0 | 100.00 +| 0162 |[Find Peak Element](src/main/java/g0101_0200/s0162_find_peak_element/Solution.java)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 0 | 100.00 #### Day 3 Two Pointers @@ -1988,7 +1988,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' |-|-|-|-|-|- | 0844 |[Backspace String Compare](src/main/java/g0801_0900/s0844_backspace_string_compare/Solution.java)| Easy | String, Two_Pointers, Stack, Simulation | 0 | 100.00 | 0986 |[Interval List Intersections](src/main/java/g0901_1000/s0986_interval_list_intersections/Solution.java)| Medium | Array, Two_Pointers | 2 | 99.95 -| 0011 |[Container With Most Water](src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 +| 0011 |[Container With Most Water](src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 #### Day 5 Sliding Window @@ -2003,7 +2003,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51 +| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, LeetCode_75_Graphs/DFS | 2 | 69.51 #### Day 7 Breadth First Search Depth First Search @@ -2039,7 +2039,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 0017 |[Letter Combinations of a Phone Number](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 +| 0017 |[Letter Combinations of a Phone Number](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 | 0022 |[Generate Parentheses](src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00 | 0079 |[Word Search](src/main/java/g0001_0100/s0079_word_search/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 64 | 98.51 @@ -2055,7 +2055,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- | 0045 |[Jump Game II](src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 -| 0062 |[Unique Paths](src/main/java/g0001_0100/s0062_unique_paths/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 +| 0062 |[Unique Paths](src/main/java/g0001_0100/s0062_unique_paths/Solution.java)| 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) | 0 | 100.00 #### Day 14 Dynamic Programming @@ -2082,14 +2082,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.42' | | | | | | |-|-|-|-|-|- -| 1143 |[Longest Common Subsequence](src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 +| 1143 |[Longest Common Subsequence](src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 | 0583 |[Delete Operation for Two Strings](src/main/java/g0501_0600/s0583_delete_operation_for_two_strings/Solution.java)| Medium | String, Dynamic_Programming | 12 | 79.10 #### Day 18 Dynamic Programming | | | | | | |-|-|-|-|-|- -| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 | 0322 |[Coin Change](src/main/java/g0301_0400/s0322_coin_change/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 12 | 92.59 | 0343 |[Integer Break](src/main/java/g0301_0400/s0343_integer_break/Solution.java)| Medium | Dynamic_Programming, Math | 0 | 100.00 diff --git a/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java b/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java index 86acdf70b..425a8ffc6 100644 --- a/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java +++ b/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java @@ -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) -// #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%) public class Solution { public int maxArea(int[] height) { diff --git a/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java b/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java index ec462f315..ab0971f2e 100644 --- a/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java +++ b/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java @@ -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) // #2024_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%) import java.util.ArrayList; diff --git a/src/main/java/g0001_0100/s0062_unique_paths/Solution.java b/src/main/java/g0001_0100/s0062_unique_paths/Solution.java index b459ef868..9e8802538 100644 --- a/src/main/java/g0001_0100/s0062_unique_paths/Solution.java +++ b/src/main/java/g0001_0100/s0062_unique_paths/Solution.java @@ -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) -// #2024_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%) +// #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) #2024_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%) public class Solution { public int uniquePaths(int m, int n) { diff --git a/src/main/java/g0001_0100/s0072_edit_distance/Solution.java b/src/main/java/g0001_0100/s0072_edit_distance/Solution.java index 94fdde280..8e65757cd 100644 --- a/src/main/java/g0001_0100/s0072_edit_distance/Solution.java +++ b/src/main/java/g0001_0100/s0072_edit_distance/Solution.java @@ -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) // #2024_11_11_Time_3_ms_(97.19%)_Space_43.2_MB_(98.23%) diff --git a/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java b/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java index 0a42a12ad..7f905b514 100644 --- a/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java +++ b/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java @@ -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) // #2024_11_13_Time_0_ms_(100.00%)_Space_42.2_MB_(88.11%) diff --git a/src/main/java/g0101_0200/s0136_single_number/Solution.java b/src/main/java/g0101_0200/s0136_single_number/Solution.java index 2a9a3683c..e6b2f514e 100644 --- a/src/main/java/g0101_0200/s0136_single_number/Solution.java +++ b/src/main/java/g0101_0200/s0136_single_number/Solution.java @@ -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) -// #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%) +// #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) #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%) public class Solution { public int singleNumber(int[] nums) { diff --git a/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java b/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java index 80c0742ee..cac739050 100644 --- a/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java +++ b/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java @@ -1,7 +1,7 @@ package g0101_0200.s0151_reverse_words_in_a_string; -// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String -// #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%) +// #Medium #String #Two_Pointers #LeetCode_75_Array/String #Udemy_Strings +// #Top_Interview_150_Array/String #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%) public class Solution { public String reverseWords(String s) { diff --git a/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java b/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java index b1d214fab..21ed18f7b 100644 --- a/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java +++ b/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java @@ -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 // #2025_03_06_Time_0_ms_(100.00%)_Space_42.78_MB_(21.39%) public class Solution { diff --git a/src/main/java/g0101_0200/s0198_house_robber/Solution.java b/src/main/java/g0101_0200/s0198_house_robber/Solution.java index 2296f04ee..7946f758f 100644 --- a/src/main/java/g0101_0200/s0198_house_robber/Solution.java +++ b/src/main/java/g0101_0200/s0198_house_robber/Solution.java @@ -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) #2024_11_15_Time_0_ms_(100.00%)_Space_40.7_MB_(77.55%) diff --git a/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java b/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java index 7febb58d3..a028b50cd 100644 --- a/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java +++ b/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java @@ -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 -// #2025_03_09_Time_0_ms_(100.00%)_Space_42.21_MB_(42.76%) +// #LeetCode_75_Binary_Tree/BFS #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree +// #Top_Interview_150_Binary_Tree_BFS #2025_03_09_Time_0_ms_(100.00%)_Space_42.21_MB_(42.76%) import com_github_leetcode.TreeNode; import java.util.ArrayList; diff --git a/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java b/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java index 8eb674d93..9e24c044f 100644 --- a/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java +++ b/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java @@ -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) -// #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%) +// #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) #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java b/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java index c40344b5e..574fa6c1d 100644 --- a/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java +++ b/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java @@ -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) // #2024_11_15_Time_32_ms_(95.05%)_Space_54.9_MB_(91.16%) diff --git a/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java b/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java index f90348989..22df02908 100644 --- a/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java +++ b/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java @@ -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_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%) +// #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_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%) import java.util.Arrays; diff --git a/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java b/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java index dd877b0a0..41f701cd1 100644 --- a/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java +++ b/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java @@ -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_07_02_Time_1_ms_(81.35%)_Space_41.8_MB_(46.36%) import java.util.ArrayList; diff --git a/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java b/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java index 154b5f9c9..32dd6075b 100644 --- a/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java +++ b/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java @@ -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) #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%) +// #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) +// #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java b/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java index c639a3c57..0ae177b08 100644 --- a/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java +++ b/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java @@ -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) -// #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%) +// #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) #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%) public class Solution { public int[] productExceptSelf(int[] nums) { diff --git a/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java b/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java index 0f66fdb10..fc89319fb 100644 --- a/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java +++ b/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java @@ -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) -// #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%) +// #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) #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%) public class Solution { public void moveZeroes(int[] nums) { diff --git a/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java b/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java index 37ff68c0e..ea997f1ca 100644 --- a/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java +++ b/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java @@ -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_07_09_Time_0_ms_(100.00%)_Space_44.8_MB_(44.32%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java b/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java index dddcf57c4..aba10e725 100644 --- a/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java +++ b/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java @@ -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_07_10_Time_2_ms_(99.33%)_Space_93.5_MB_(47.20%) public class Solution { diff --git a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java index 1c7d258e0..1fcc7035d 100644 --- a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java +++ b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java @@ -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) #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%) public class Solution { public int[] countBits(int num) { diff --git a/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java b/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java index 70cb6a274..1baf216c9 100644 --- a/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java +++ b/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java @@ -1,6 +1,7 @@ package g0301_0400.s0345_reverse_vowels_of_a_string; -// #Easy #String #Two_Pointers #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%) +// #Easy #String #Two_Pointers #LeetCode_75_Array/String +// #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%) public class Solution { private boolean isVowel(char c) { diff --git a/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java b/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java index fa6542fb8..f91e1e6ed 100644 --- a/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java +++ b/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java @@ -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_07_12_Time_0_ms_(100.00%)_Space_40.4_MB_(74.20%) /* diff --git a/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java b/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java index 932c1a5df..7b7a92306 100644 --- a/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java +++ b/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java @@ -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 -// #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%) +// #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 #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%) public class Solution { public boolean isSubsequence(String s, String t) { diff --git a/src/main/java/g0301_0400/s0394_decode_string/Solution.java b/src/main/java/g0301_0400/s0394_decode_string/Solution.java index ef0191a90..4a3790208 100644 --- a/src/main/java/g0301_0400/s0394_decode_string/Solution.java +++ b/src/main/java/g0301_0400/s0394_decode_string/Solution.java @@ -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) #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%) +// #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) +// #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%) public class Solution { private int i = 0; diff --git a/src/main/java/g0301_0400/s0399_evaluate_division/Solution.java b/src/main/java/g0301_0400/s0399_evaluate_division/Solution.java index 5bc001e49..a7a47db38 100644 --- a/src/main/java/g0301_0400/s0399_evaluate_division/Solution.java +++ b/src/main/java/g0301_0400/s0399_evaluate_division/Solution.java @@ -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_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%) +// #LeetCode_75_Graphs/DFS #Top_Interview_150_Graph_General +// #2022_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%) import java.util.HashMap; import java.util.List; diff --git a/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java b/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java index 0d1fd5e03..b87a689b7 100644 --- a/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java +++ b/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java @@ -1,7 +1,7 @@ package g0401_0500.s0435_non_overlapping_intervals; -// #Medium #Array #Dynamic_Programming #Sorting #Greedy #Data_Structure_II_Day_4_Array -// #2022_07_16_Time_96_ms_(47.37%)_Space_106.6_MB_(6.15%) +// #Medium #Array #Dynamic_Programming #Sorting #Greedy #LeetCode_75_Intervals +// #Data_Structure_II_Day_4_Array #2022_07_16_Time_96_ms_(47.37%)_Space_106.6_MB_(6.15%) import java.util.Arrays; diff --git a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java index 421cf21a1..e2ae31d6a 100644 --- a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java +++ b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java @@ -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) -// #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%) +// #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) #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%) import com_github_leetcode.TreeNode; import java.util.HashMap; diff --git a/src/main/java/g0401_0500/s0443_string_compression/Solution.java b/src/main/java/g0401_0500/s0443_string_compression/Solution.java index 696137bb6..fdd5ef7d7 100644 --- a/src/main/java/g0401_0500/s0443_string_compression/Solution.java +++ b/src/main/java/g0401_0500/s0443_string_compression/Solution.java @@ -1,6 +1,7 @@ package g0401_0500.s0443_string_compression; -// #Medium #String #Two_Pointers #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%) +// #Medium #String #Two_Pointers #LeetCode_75_Array/String +// #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%) public class Solution { /* This is breaking the rules, it's not in-place. */ diff --git a/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java b/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java index 3f728c723..a611a2fe4 100644 --- a/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java +++ b/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java @@ -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_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%) +// #Medium #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree +// #Data_Structure_II_Day_16_Tree #2022_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java b/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java index f28773df7..27c4cb274 100644 --- a/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java +++ b/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java @@ -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 // #2025_03_09_Time_52_ms_(89.91%)_Space_68.86_MB_(77.92%) import java.util.Arrays; diff --git a/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java b/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java index adfaca778..19e55c8b1 100644 --- a/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java +++ b/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java @@ -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 // #2022_08_02_Time_2_ms_(69.51%)_Space_54.2_MB_(42.16%) diff --git a/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java b/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java index 9e5c28991..124fbcf7d 100644 --- a/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java +++ b/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java @@ -1,6 +1,7 @@ package g0601_0700.s0605_can_place_flowers; -// #Easy #Array #Greedy #Udemy_Arrays #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%) +// #Easy #Array #Greedy #LeetCode_75_Array/String #Udemy_Arrays +// #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%) public class Solution { public boolean canPlaceFlowers(int[] flowerbed, int n) { diff --git a/src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java b/src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java index 057eff8a6..b460dbe53 100644 --- a/src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java +++ b/src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java @@ -1,6 +1,7 @@ package g0601_0700.s0643_maximum_average_subarray_i; -// #Easy #Array #Sliding_Window #2022_03_21_Time_5_ms_(74.81%)_Space_58.3_MB_(84.86%) +// #Easy #Array #Sliding_Window #LeetCode_75_Sliding_Window +// #2022_03_21_Time_5_ms_(74.81%)_Space_58.3_MB_(84.86%) public class Solution { public double findMaxAverage(int[] nums, int k) { diff --git a/src/main/java/g0601_0700/s0649_dota2_senate/Solution.java b/src/main/java/g0601_0700/s0649_dota2_senate/Solution.java index a39fc93a3..5fbdbf08d 100644 --- a/src/main/java/g0601_0700/s0649_dota2_senate/Solution.java +++ b/src/main/java/g0601_0700/s0649_dota2_senate/Solution.java @@ -1,6 +1,7 @@ package g0601_0700.s0649_dota2_senate; -// #Medium #String #Greedy #Queue #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%) +// #Medium #String #Greedy #Queue #LeetCode_75_Queue +// #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%) public class Solution { public String predictPartyVictory(String senate) { diff --git a/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java b/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java index ad3572923..9ced313cb 100644 --- a/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java +++ b/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java @@ -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 -// #2022_03_22_Time_0_ms_(100.00%)_Space_52.3_MB_(6.38%) +// #Easy #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree +// #Data_Structure_I_Day_13_Tree #2022_03_22_Time_0_ms_(100.00%)_Space_52.3_MB_(6.38%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java b/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java index 24005f1e5..1d5cf006c 100644 --- a/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java +++ b/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java @@ -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 -// #2022_03_24_Time_4_ms_(78.57%)_Space_75.9_MB_(33.27%) +// #Medium #Array #Dynamic_Programming #Greedy #LeetCode_75_DP/Multidimensional +// #Dynamic_Programming_I_Day_8 #2022_03_24_Time_4_ms_(78.57%)_Space_75.9_MB_(33.27%) public class Solution { public int maxProfit(int[] prices, int fee) { diff --git a/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java b/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java index 0c62116d8..8dd02e9de 100644 --- a/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java +++ b/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java @@ -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 // #2022_03_24_Time_2_ms_(69.67%)_Space_52.1_MB_(59.19%) public class Solution { diff --git a/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java b/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java index d600bbdaa..c2a9ed6cf 100644 --- a/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java +++ b/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java @@ -1,6 +1,7 @@ package g0701_0800.s0735_asteroid_collision; -// #Medium #Array #Stack #Level_2_Day_18_Stack #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%) +// #Medium #Array #Stack #LeetCode_75_Stack #Level_2_Day_18_Stack +// #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%) import java.util.Deque; import java.util.LinkedList; diff --git a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java index 86c5856ca..7660afb50 100644 --- a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java +++ b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java @@ -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) #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%) +// #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) +// #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%) @SuppressWarnings("java:S135") public class Solution { diff --git a/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java b/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java index 130c898d9..7104d2892 100644 --- a/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java +++ b/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java @@ -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 #2022_03_25_Time_1_ms_(86.38%)_Space_43.6_MB_(54.14%) public class Solution { diff --git a/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling/Solution.java b/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling/Solution.java index 14e78598a..d23e1287f 100644 --- a/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling/Solution.java +++ b/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling/Solution.java @@ -1,6 +1,7 @@ package g0701_0800.s0790_domino_and_tromino_tiling; -// #Medium #Dynamic_Programming #2022_03_26_Time_0_ms_(100.00%)_Space_42_MB_(14.39%) +// #Medium #Dynamic_Programming #LeetCode_75_DP/1D +// #2022_03_26_Time_0_ms_(100.00%)_Space_42_MB_(14.39%) public class Solution { public int numTilings(int n) { diff --git a/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java b/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java index 506e34ae8..b6ab889eb 100644 --- a/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java +++ b/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java @@ -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 #2022_03_24_Time_3_ms_(51.54%)_Space_42.3_MB_(75.53%) +// #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 +// #2022_03_24_Time_3_ms_(51.54%)_Space_42.3_MB_(75.53%) import java.util.HashSet; import java.util.List; diff --git a/src/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java b/src/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java index 7f80bd695..c53a5fa8a 100644 --- a/src/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java +++ b/src/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java @@ -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 // #2022_03_28_Time_0_ms_(100.00%)_Space_41.8_MB_(64.12%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java b/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java index 251e862a3..60c0570aa 100644 --- a/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java +++ b/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java @@ -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 // #2022_03_28_Time_15_ms_(91.32%)_Space_55_MB_(6.01%) public class Solution { diff --git a/src/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java b/src/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java index c94be5e6a..3ebacc4c4 100644 --- a/src/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java +++ b/src/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java @@ -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 // #2022_03_28_Time_47_ms_(76.17%)_Space_88.8_MB_(5.16%) import java.util.Deque; diff --git a/src/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java b/src/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java index db8e07a16..82b929886 100644 --- a/src/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java +++ b/src/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java @@ -1,6 +1,7 @@ package g0901_1000.s0933_number_of_recent_calls; -// #Easy #Design #Queue #Data_Stream #2022_03_30_Time_16_ms_(97.58%)_Space_50.8_MB_(80.12%) +// #Easy #Design #Queue #Data_Stream #LeetCode_75_Queue +// #2022_03_30_Time_16_ms_(97.58%)_Space_50.8_MB_(80.12%) import java.util.LinkedList; import java.util.Queue; diff --git a/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java b/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java index 01fe749bc..ce9a7533a 100644 --- a/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java +++ b/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java @@ -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 // #2022_02_17_Time_3_ms_(74.27%)_Space_42.9_MB_(18.68%) diff --git a/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java b/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java index e1499b469..522d2e319 100644 --- a/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java +++ b/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java @@ -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 // #2022_02_27_Time_3_ms_(79.01%)_Space_68.2_MB_(65.91%) public class Solution { diff --git a/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.java b/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.java index f3a3fff8b..1cb90dd33 100644 --- a/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.java +++ b/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.java @@ -1,6 +1,7 @@ package g1001_1100.s1071_greatest_common_divisor_of_strings; -// #Easy #String #Math #2022_02_27_Time_1_ms_(82.09%)_Space_42.6_MB_(33.55%) +// #Easy #String #Math #LeetCode_75_Array/String +// #2022_02_27_Time_1_ms_(82.09%)_Space_42.6_MB_(33.55%) public class Solution { public String gcdOfStrings(String str1, String str2) { diff --git a/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java b/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java index f8e0b7a88..b5acb7225 100644 --- a/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java +++ b/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java @@ -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_06_01_Time_0_ms_(100.00%)_Space_39.6_MB_(48.37%) public class Solution { diff --git a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java index eef86afad..363f23b1d 100644 --- a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java +++ b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java @@ -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) // #2024_11_17_Time_19_ms_(89.05%)_Space_50.9_MB_(33.70%) diff --git a/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java b/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java index d06730a8b..4a4c590d1 100644 --- a/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java +++ b/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java @@ -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_06_02_Time_7_ms_(97.19%)_Space_46.3_MB_(31.31%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java b/src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java index cb3c6d89d..2eef033e2 100644 --- a/src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java +++ b/src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java @@ -1,6 +1,7 @@ package g1201_1300.s1207_unique_number_of_occurrences; -// #Easy #Array #Hash_Table #2022_04_29_Time_2_ms_(82.71%)_Space_42.4_MB_(34.08%) +// #Easy #Array #Hash_Table #LeetCode_75_Hash_Map/Set +// #2022_04_29_Time_2_ms_(82.71%)_Space_42.4_MB_(34.08%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g1201_1300/s1268_search_suggestions_system/Solution.java b/src/main/java/g1201_1300/s1268_search_suggestions_system/Solution.java index 5ca04e9b7..8bc61bd45 100644 --- a/src/main/java/g1201_1300/s1268_search_suggestions_system/Solution.java +++ b/src/main/java/g1201_1300/s1268_search_suggestions_system/Solution.java @@ -1,6 +1,6 @@ package g1201_1300.s1268_search_suggestions_system; -// #Medium #Array #String #2022_03_14_Time_28_ms_(78.06%)_Space_73.1_MB_(38.32%) +// #Medium #Array #String #LeetCode_75_Trie #2022_03_14_Time_28_ms_(78.06%)_Space_73.1_MB_(38.32%) import java.util.ArrayList; import java.util.Arrays; diff --git a/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.java b/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.java index 007e50311..f6afffa22 100644 --- a/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.java +++ b/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.java @@ -1,6 +1,7 @@ package g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c; -// #Medium #Bit_Manipulation #2022_03_19_Time_0_ms_(100.00%)_Space_40.6_MB_(60.32%) +// #Medium #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #2022_03_19_Time_0_ms_(100.00%)_Space_40.6_MB_(60.32%) public class Solution { public static int csb(int n) { diff --git a/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.java b/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.java index 31200e0d6..efdd937bf 100644 --- a/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.java +++ b/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.java @@ -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 // #2022_03_21_Time_9_ms_(64.47%)_Space_74_MB_(56.45%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.java b/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.java index 1f0ac0d72..06f5b630e 100644 --- a/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.java +++ b/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.java @@ -1,6 +1,6 @@ package g1401_1500.s1431_kids_with_the_greatest_number_of_candies; -// #Easy #Array #2022_03_28_Time_1_ms_(84.43%)_Space_43.3_MB_(19.35%) +// #Easy #Array #LeetCode_75_Array/String #2022_03_28_Time_1_ms_(84.43%)_Space_43.3_MB_(19.35%) import java.util.ArrayList; import java.util.List; diff --git a/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.java b/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.java index ff4ba0138..e67fc9ba4 100644 --- a/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.java +++ b/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.java @@ -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 // #2022_03_28_Time_2_ms_(99.63%)_Space_60.1_MB_(26.46%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.java b/src/main/java/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.java index 8d597766c..301f44a19 100644 --- a/src/main/java/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.java +++ b/src/main/java/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.java @@ -1,6 +1,7 @@ package g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length; -// #Medium #String #Sliding_Window #2022_03_28_Time_19_ms_(53.73%)_Space_47.8_MB_(64.37%) +// #Medium #String #Sliding_Window #LeetCode_75_Sliding_Window +// #2022_03_28_Time_19_ms_(53.73%)_Space_47.8_MB_(64.37%) public class Solution { private boolean isVowel(char c) { diff --git a/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java b/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java index 49079df42..612096c3c 100644 --- a/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java +++ b/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java @@ -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 #2022_03_29_Time_39_ms_(97.71%)_Space_65.2_MB_(94.87%) import java.util.ArrayList; diff --git a/src/main/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.java b/src/main/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.java index 997c825c2..2a56a4a4c 100644 --- a/src/main/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.java +++ b/src/main/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.java @@ -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 // #2022_03_23_Time_2_ms_(87.25%)_Space_58.4_MB_(29.26%) public class Solution { diff --git a/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.java b/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.java index 2d04b9c2b..51c637c8c 100644 --- a/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.java +++ b/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.java @@ -1,6 +1,7 @@ package g1601_1700.s1657_determine_if_two_strings_are_close; -// #Medium #String #Hash_Table #Sorting #2022_04_23_Time_12_ms_(97.58%)_Space_59.6_MB_(39.11%) +// #Medium #String #Hash_Table #Sorting #LeetCode_75_Hash_Map/Set +// #2022_04_23_Time_12_ms_(97.58%)_Space_59.6_MB_(39.11%) import java.util.Arrays; diff --git a/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java b/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java index 965d430e3..671a5ab51 100644 --- a/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java +++ b/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java @@ -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 // #2022_04_21_Time_20_ms_(91.22%)_Space_52.7_MB_(87.98%) import java.util.Arrays; diff --git a/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java b/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java index c7387ec64..500917a43 100644 --- a/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java +++ b/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java @@ -1,6 +1,7 @@ package g1701_1800.s1732_find_the_highest_altitude; -// #Easy #Array #Prefix_Sum #2022_04_28_Time_0_ms_(100.00%)_Space_40.1_MB_(83.65%) +// #Easy #Array #Prefix_Sum #LeetCode_75_Prefix_Sum +// #2022_04_28_Time_0_ms_(100.00%)_Space_40.1_MB_(83.65%) public class Solution { public int largestAltitude(int[] gain) { diff --git a/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java b/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java index 4a60ee249..f0fcde621 100644 --- a/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java +++ b/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java @@ -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 // #2022_04_27_Time_1_ms_(86.26%)_Space_41.7_MB_(79.68%) public class Solution { diff --git a/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java b/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java index 7e58a9512..39eae18ba 100644 --- a/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java +++ b/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java @@ -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 // #2022_05_14_Time_12_ms_(40.55%)_Space_43.3_MB_(92.19%) import java.util.LinkedList; diff --git a/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java b/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java index 3235ec42a..2b9e1329f 100644 --- a/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java +++ b/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java @@ -1,6 +1,7 @@ package g2001_2100.s2095_delete_the_middle_node_of_a_linked_list; -// #Medium #Two_Pointers #Linked_List #2022_05_24_Time_4_ms_(95.21%)_Space_221.2_MB_(35.96%) +// #Medium #Two_Pointers #Linked_List #LeetCode_75_LinkedList +// #2022_05_24_Time_4_ms_(95.21%)_Space_221.2_MB_(35.96%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.java b/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.java index 78c2d2d46..94a325415 100644 --- a/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.java +++ b/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.java @@ -1,6 +1,7 @@ package g2101_2200.s2130_maximum_twin_sum_of_a_linked_list; -// #Medium #Two_Pointers #Stack #Linked_List #2022_06_03_Time_9_ms_(57.92%)_Space_118.7_MB_(38.33%) +// #Medium #Two_Pointers #Stack #Linked_List #LeetCode_75_LinkedList +// #2022_06_03_Time_9_ms_(57.92%)_Space_118.7_MB_(38.33%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.java b/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.java index 8d3b49d51..9a953366d 100644 --- a/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.java +++ b/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.java @@ -1,6 +1,7 @@ package g2201_2300.s2215_find_the_difference_of_two_arrays; -// #Easy #Array #Hash_Table #2022_06_09_Time_11_ms_(87.39%)_Space_43.2_MB_(77.06%) +// #Easy #Array #Hash_Table #LeetCode_75_Hash_Map/Set +// #2022_06_09_Time_11_ms_(87.39%)_Space_43.2_MB_(77.06%) import java.util.ArrayList; import java.util.Arrays; diff --git a/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.java b/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.java index 7ee5a3b48..843406962 100644 --- a/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.java +++ b/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.java @@ -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 // #2022_06_14_Time_85_ms_(71.70%)_Space_135.9_MB_(33.90%) import java.util.Arrays; diff --git a/src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.java b/src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.java index 2c7195a5e..02a6d7479 100644 --- a/src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.java +++ b/src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.java @@ -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 // #2022_07_13_Time_12_ms_(96.69%)_Space_54.8_MB_(57.87%) public class SmallestInfiniteSet { diff --git a/src/main/java/g2301_2400/s2352_equal_row_and_column_pairs/Solution.java b/src/main/java/g2301_2400/s2352_equal_row_and_column_pairs/Solution.java index 6c3d9badb..96aec3e04 100644 --- a/src/main/java/g2301_2400/s2352_equal_row_and_column_pairs/Solution.java +++ b/src/main/java/g2301_2400/s2352_equal_row_and_column_pairs/Solution.java @@ -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 // #2022_08_07_Time_7_ms_(98.94%)_Space_71.4_MB_(27.97%) import java.util.Arrays; diff --git a/src/main/java/g2301_2400/s2390_removing_stars_from_a_string/Solution.java b/src/main/java/g2301_2400/s2390_removing_stars_from_a_string/Solution.java index 727adfb84..9fd3eac20 100644 --- a/src/main/java/g2301_2400/s2390_removing_stars_from_a_string/Solution.java +++ b/src/main/java/g2301_2400/s2390_removing_stars_from_a_string/Solution.java @@ -1,6 +1,7 @@ package g2301_2400.s2390_removing_stars_from_a_string; -// #Medium #String #Stack #Simulation #2022_09_02_Time_31_ms_(90.55%)_Space_62.6_MB_(76.40%) +// #Medium #String #Stack #Simulation #LeetCode_75_Stack +// #2022_09_02_Time_31_ms_(90.55%)_Space_62.6_MB_(76.40%) public class Solution { public String removeStars(String s) { diff --git a/src/main/java/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.java b/src/main/java/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.java index d02ea1508..081a8d5ee 100644 --- a/src/main/java/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.java +++ b/src/main/java/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.java @@ -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_01_07_Time_57_ms_(96.24%)_Space_54_MB_(92.26%) import java.util.PriorityQueue; diff --git a/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java b/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java index d7952158a..925c9209d 100644 --- a/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java +++ b/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java @@ -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_05_09_Time_94_ms_(84.75%)_Space_56.5_MB_(81.92%) import java.util.Arrays;