diff --git a/README.md b/README.md index cd5141295..f8c16e086 100644 --- a/README.md +++ b/README.md @@ -94,7 +94,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 79.54 +| 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 | 79.54 | 1672 |[Richest Customer Wealth](src/main/java/g1601_1700/s1672_richest_customer_wealth/Solution.java)| Easy | Array, Matrix | 0 | 100.00 #### Day 7 Array @@ -135,7 +135,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' |-|-|-|-|-|- | 1356 |[Sort Integers by The Number of 1 Bits](src/main/java/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/Solution.java)| Easy | Array, Sorting, Bit_Manipulation, Counting | 10 | 65.50 | 0232 |[Implement Queue using Stacks](src/main/java/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.java)| Easy | Stack, Design, Queue | 1 | 67.21 -| 0242 |[Valid Anagram](src/main/java/g0201_0300/s0242_valid_anagram/Solution.java)| Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 2 | 99.01 +| 0242 |[Valid Anagram](src/main/java/g0201_0300/s0242_valid_anagram/Solution.java)| Easy | String, Hash_Table, Sorting | 2 | 99.01 | 0217 |[Contains Duplicate](src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 6 | 96.68 #### Day 12 Class and Object @@ -200,7 +200,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0054 |[Spiral Matrix](src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java)| Medium | Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 +| 0054 |[Spiral Matrix](src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 | 0973 |[K Closest Points to Origin](src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java)| Medium | Array, Math, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Geometry, Quickselect | 4 | 98.26 #### Day 9 @@ -270,8 +270,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0155 |[Min Stack](src/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 3 | 100.00 -| 0341 |[Flatten Nested List Iterator](src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java)| Medium | Top_Interview_Questions, Depth_First_Search, Tree, Stack, Design, Queue, Iterator | 2 | 99.95 +| 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) | 3 | 100.00 +| 0341 |[Flatten Nested List Iterator](src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java)| Medium | Depth_First_Search, Tree, Stack, Design, Queue, Iterator | 2 | 99.95 #### Day 19 @@ -284,7 +284,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0380 |[Insert Delete GetRandom O(1)](src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java)| Medium | Top_Interview_Questions, Array, Hash_Table, Math, Design, Randomized | 27 | 93.44 +| 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 | 0622 |[Design Circular Queue](src/main/java/g0601_0700/s0622_design_circular_queue/MyCircularQueue.java)| Medium | Array, Design, Linked_List, Queue | 3 | 100.00 | 0729 |[My Calendar I](src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java)| Medium | Binary_Search, Design, Ordered_Set, Segment_Tree | 17 | 97.23 @@ -525,7 +525,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00 +| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 0 | 100.00 | 0278 |[First Bad Version](src/main/java/g0201_0300/s0278_first_bad_version/Solution.java)| Easy | Binary_Search, Interactive | 15 | 87.89 #### Day 8 Binary Search Tree @@ -533,7 +533,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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 -| 0235 |[Lowest Common Ancestor of a Binary Search Tree](src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 4 | 100.00 +| 0235 |[Lowest Common Ancestor of a Binary Search Tree](src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 4 | 100.00 #### Day 9 Graph/BFS/DFS @@ -591,14 +591,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 1 | 98.59 -| 0054 |[Spiral Matrix](src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java)| Medium | Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 +| 0054 |[Spiral Matrix](src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 | 1706 |[Where Will the Ball Fall](src/main/java/g1701_1800/s1706_where_will_the_ball_fall/Solution.java)| Medium | Array, Dynamic_Programming, Depth_First_Search, Matrix, Simulation | 2 | 64.55 #### Day 2 String | | | | | | |-|-|-|-|-|- -| 0014 |[Longest Common Prefix](src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java)| Easy | Top_Interview_Questions, 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 | 0043 |[Multiply Strings](src/main/java/g0001_0100/s0043_multiply_strings/Solution.java)| Medium | String, Math, Simulation | 1 | 100.00 #### Day 3 Linked List @@ -606,13 +606,13 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0019 |[Remove Nth Node From End of List](src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00 -| 0234 |[Palindrome Linked List](src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 6 | 76.07 +| 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) | 6 | 76.07 #### Day 4 Linked List | | | | | | |-|-|-|-|-|- -| 0328 |[Odd Even Linked List](src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java)| Medium | Top_Interview_Questions, 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 | 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)) | 12 | 85.82 #### Day 5 Greedy @@ -634,7 +634,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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) | 1 | 65.86 -| 0437 |[Path Sum III](src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 18 | 45.66 +| 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) | 18 | 45.66 #### Day 8 Binary Search @@ -648,14 +648,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0108 |[Convert Sorted Array to Binary Search Tree](src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.java)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 0 | 100.00 -| 0230 |[Kth Smallest Element in a BST](src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/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(n) | 1 | 78.91 +| 0230 |[Kth Smallest Element in a BST](src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 1 | 78.91 | 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 | 18 | 84.18 #### Day 10 Graph/BFS/DFS | | | | | | |-|-|-|-|-|- -| 0994 |[Rotting Oranges](src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java)| Medium | 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 | 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 @@ -670,7 +670,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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 -| 0322 |[Coin Change](src/main/java/g0301_0400/s0322_coin_change/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 17 | 91.77 +| 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) | 17 | 91.77 #### Day 13 Dynamic Programming @@ -693,14 +693,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' |-|-|-|-|-|- | 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 | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 94.57 +| 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 | 1 | 94.57 #### Day 16 Design | | | | | | |-|-|-|-|-|- | 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)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 3 | 100.00 +| 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) | 3 | 100.00 | 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) | 34 | 99.90 #### Day 17 Interval @@ -715,7 +715,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0735 |[Asteroid Collision](src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java)| Medium | Array, Stack | 2 | 99.59 -| 0227 |[Basic Calculator II](src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java)| Medium | Top_Interview_Questions, String, Math, Stack | 8 | 95.32 +| 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 @@ -737,7 +737,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0412 |[Fizz Buzz](src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java)| Easy | Top_Interview_Questions, String, Math, Simulation | 1 | 100.00 +| 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.97 | 0007 |[Reverse Integer](src/main/java/g0001_0100/s0007_reverse_integer/Solution.java)| Medium | Top_Interview_Questions, Math | 1 | 96.61 | 0009 |[Palindrome Number](src/main/java/g0001_0100/s0009_palindrome_number/Solution.java)| Easy | Math | 5 | 77.91 @@ -748,14 +748,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0344 |[Reverse String](src/main/java/g0301_0400/s0344_reverse_string/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 1 | 99.91 -| 0014 |[Longest Common Prefix](src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java)| Easy | Top_Interview_Questions, String | 0 | 100.00 +| 0344 |[Reverse String](src/main/java/g0301_0400/s0344_reverse_string/Solution.java)| Easy | String, Two_Pointers, Recursion | 1 | 99.91 +| 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 | 0187 |[Repeated DNA Sequences](src/main/java/g0101_0200/s0187_repeated_dna_sequences/Solution.java)| Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 29 | 77.11 | 0003 |[Longest Substring Without Repeating Characters](src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 2 | 99.52 | 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) | 1 | 98.78 | 0005 |[Longest Palindromic Substring](src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 7 | 96.96 | 0394 |[Decode String](src/main/java/g0301_0400/s0394_decode_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 1 | 87.68 -| 0242 |[Valid Anagram](src/main/java/g0201_0300/s0242_valid_anagram/Solution.java)| Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 2 | 99.01 +| 0242 |[Valid Anagram](src/main/java/g0201_0300/s0242_valid_anagram/Solution.java)| Easy | String, Hash_Table, Sorting | 2 | 99.01 | 0049 |[Group Anagrams](src/main/java/g0001_0100/s0049_group_anagrams/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 6 | 92.28 | 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.94 | 0273 |[Integer to English Words](src/main/java/g0201_0300/s0273_integer_to_english_words/Solution.java)| Hard | String, Math, Recursion | 3 | 95.67 @@ -764,7 +764,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00 +| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Top_100_Liked_Questions, Array, 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 | 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 @@ -773,7 +773,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0121 |[Best Time to Buy and Sell Stock](src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 100.00 -| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 79.54 +| 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 | 79.54 | 0001 |[Two Sum](src/main/java/g0001_0100/s0001_two_sum/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 2 | 85.97 | 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 @@ -784,7 +784,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | 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) | 2 | 79.47 | 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, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 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 | 100.00 | 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 @@ -795,7 +795,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | 1007 |[Minimum Domino Rotations For Equal Row](src/main/java/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/Solution.java)| Medium | Array, Greedy | 5 | 79.64 | 1306 |[Jump Game III](src/main/java/g1301_1400/s1306_jump_game_iii/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search | 2 | 96.23 | 0456 |[132 Pattern](src/main/java/g0401_0500/s0456_132_pattern/Solution.java)| Medium | Array, Binary_Search, Stack, Ordered_Set, Monotonic_Stack | 16 | 82.41 -| 0239 |[Sliding Window Maximum](src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 58 | 52.28 +| 0239 |[Sliding Window Maximum](src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 58 | 52.28 #### Udemy Two Pointers @@ -812,7 +812,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0053 |[Maximum Subarray](src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 +| 0053 |[Maximum Subarray](src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 | 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 | 100.00 #### Udemy Sorting Algorithms @@ -827,7 +827,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' |-|-|-|-|-|- | 0304 |[Range Sum Query 2D - Immutable](src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.java)| Medium | Array, Matrix, Design, Prefix_Sum | 153 | 87.51 | 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 -| 0054 |[Spiral Matrix](src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java)| Medium | Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 +| 0054 |[Spiral Matrix](src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00 | 0048 |[Rotate Image](src/main/java/g0001_0100/s0048_rotate_image/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 0 | 100.00 | 1572 |[Matrix Diagonal Sum](src/main/java/g1501_1600/s1572_matrix_diagonal_sum/Solution.java)| Easy | Array, Matrix | 0 | 100.00 | 0073 |[Set Matrix Zeroes](src/main/java/g0001_0100/s0073_set_matrix_zeroes/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m\*n)_Space_O(1) | 1 | 79.07 @@ -839,7 +839,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' |-|-|-|-|-|- | 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) | 1 | 75.27 | 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 | Top_Interview_Questions, 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 | 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 @@ -848,7 +848,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | 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 | 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.68 -| 0234 |[Palindrome Linked List](src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 6 | 76.07 +| 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) | 6 | 76.07 | 0138 |[Copy List with Random Pointer](src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0025 |[Reverse Nodes in k-Group](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 | 0146 |[LRU Cache](src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 87 | 50.80 @@ -873,11 +873,11 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | 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 | 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 | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 7 | 98.13 +| 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) | 1 | 99.46 | 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, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 10 | 56.51 +| 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) | 10 | 56.51 | 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 @@ -900,7 +900,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0120 |[Triangle](src/main/java/g0101_0200/s0120_triangle/Solution.java)| Medium | Array, Dynamic_Programming | 2 | 94.63 -| 0118 |[Pascal's Triangle](src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08 +| 0118 |[Pascal's Triangle](src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08 | 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) | 2 | 97.08 | 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) | 0 | 100.00 @@ -909,11 +909,11 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | 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) | 0 | 100.00 -| 0300 |[Longest Increasing Subsequence](src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 3 | 98.63 +| 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 | 98.63 | 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) | 33 | 46.23 -| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 4 | 90.13 +| 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) | 4 | 90.13 | 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_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 1 | 100.00 +| 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 #### Udemy Backtracking/Recursion @@ -935,15 +935,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | 0190 |[Reverse Bits](src/main/java/g0101_0200/s0190_reverse_bits/Solution.java)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 1 | 98.66 | 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 | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 86.73 -| 0371 |[Sum of Two Integers](src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java)| Medium | Top_Interview_Questions, Math, Bit_Manipulation | 0 | 100.00 +| 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 | 86.73 +| 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 #### Udemy Design | | | | | | |-|-|-|-|-|- -| 0155 |[Min Stack](src/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 3 | 100.00 +| 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) | 3 | 100.00 ### Data Structure I @@ -952,7 +952,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0217 |[Contains Duplicate](src/main/java/g0201_0300/s0217_contains_duplicate/Solution.java)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 6 | 96.68 -| 0053 |[Maximum Subarray](src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 +| 0053 |[Maximum Subarray](src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 #### Day 2 Array @@ -965,7 +965,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0350 |[Intersection of Two Arrays II](src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 4 | 69.62 +| 0350 |[Intersection of Two Arrays II](src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 4 | 69.62 | 0121 |[Best Time to Buy and Sell Stock](src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 100.00 #### Day 4 Array @@ -973,7 +973,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0566 |[Reshape the Matrix](src/main/java/g0501_0600/s0566_reshape_the_matrix/Solution.java)| Easy | Array, Matrix, Simulation | 1 | 90.08 -| 0118 |[Pascal's Triangle](src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08 +| 0118 |[Pascal's Triangle](src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08 #### Day 5 Array @@ -986,9 +986,9 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0387 |[First Unique Character in a String](src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java)| Easy | Top_Interview_Questions, String, Hash_Table, Counting, Queue | 1 | 100.00 +| 0387 |[First Unique Character in a String](src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java)| Easy | String, Hash_Table, Counting, Queue | 1 | 100.00 | 0383 |[Ransom Note](src/main/java/g0301_0400/s0383_ransom_note/Solution.java)| Easy | String, Hash_Table, Counting | 1 | 99.97 -| 0242 |[Valid Anagram](src/main/java/g0201_0300/s0242_valid_anagram/Solution.java)| Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 2 | 99.01 +| 0242 |[Valid Anagram](src/main/java/g0201_0300/s0242_valid_anagram/Solution.java)| Easy | String, Hash_Table, Sorting | 2 | 99.01 #### Day 7 Linked List @@ -1048,7 +1048,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' |-|-|-|-|-|- | 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 | 0653 |[Two Sum IV - Input is a BST](src/main/java/g0601_0700/s0653_two_sum_iv_input_is_a_bst/Solution.java)| Easy | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Two_Pointers, Binary_Search_Tree | 5 | 74.23 -| 0235 |[Lowest Common Ancestor of a Binary Search Tree](src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java)| Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 4 | 100.00 +| 0235 |[Lowest Common Ancestor of a Binary Search Tree](src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 4 | 100.00 ### Data Structure II @@ -1080,15 +1080,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0240 |[Search a 2D Matrix II](src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 7 | 86.73 +| 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) | 7 | 86.73 | 0435 |[Non-overlapping Intervals](src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java)| Medium | Array, Dynamic_Programming, Sorting, Greedy | 96 | 47.37 #### Day 5 Array | | | | | | |-|-|-|-|-|- -| 0334 |[Increasing Triplet Subsequence](src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java)| Medium | Top_Interview_Questions, 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, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 100.00 +| 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 | 100.00 | 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) | 21 | 98.97 #### Day 6 String @@ -1103,7 +1103,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0290 |[Word Pattern](src/main/java/g0201_0300/s0290_word_pattern/Solution.java)| Easy | String, Hash_Table | 1 | 97.26 -| 0763 |[Partition Labels](src/main/java/g0701_0800/s0763_partition_labels/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 +| 0763 |[Partition Labels](src/main/java/g0701_0800/s0763_partition_labels/Solution.java)| Medium | String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 #### Day 8 String @@ -1151,7 +1151,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0155 |[Min Stack](src/main/java/g0101_0200/s0155_min_stack/MinStack.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 3 | 100.00 +| 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) | 3 | 100.00 | 1249 |[Minimum Remove to Make Valid Parentheses](src/main/java/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses/Solution.java)| Medium | String, Stack | 13 | 94.62 | 1823 |[Find the Winner of the Circular Game](src/main/java/g1801_1900/s1823_find_the_winner_of_the_circular_game/Solution.java)| Medium | Array, Math, Simulation, Recursion, Queue | 3 | 64.85 @@ -1167,7 +1167,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0199 |[Binary Tree Right Side View](src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 94.57 +| 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 | 1 | 94.57 | 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 @@ -1175,15 +1175,15 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0230 |[Kth Smallest Element in a BST](src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/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(n) | 1 | 78.91 +| 0230 |[Kth Smallest Element in a BST](src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 1 | 78.91 | 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 | 18 | 84.18 #### Day 18 Tree | | | | | | |-|-|-|-|-|- -| 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, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 10 | 56.51 -| 0297 |[Serialize and Deserialize Binary Tree](src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java)| Hard | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 7 | 98.13 +| 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) | 10 | 56.51 +| 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 @@ -1198,7 +1198,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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 -| 0347 |[Top K Frequent Elements](src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_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.93 +| 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.93 #### Day 21 Heap Priority Queue @@ -1213,7 +1213,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00 +| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 0 | 100.00 | 0278 |[First Bad Version](src/main/java/g0201_0300/s0278_first_bad_version/Solution.java)| Easy | Binary_Search, Interactive | 15 | 87.89 | 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 @@ -1228,14 +1228,14 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0283 |[Move Zeroes](src/main/java/g0201_0300/s0283_move_zeroes/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 79.54 +| 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 | 79.54 | 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 | 1 | 99.21 #### Day 4 Two Pointers | | | | | | |-|-|-|-|-|- -| 0344 |[Reverse String](src/main/java/g0301_0400/s0344_reverse_string/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 1 | 99.91 +| 0344 |[Reverse String](src/main/java/g0301_0400/s0344_reverse_string/Solution.java)| Easy | String, Two_Pointers, Recursion | 1 | 99.91 | 0557 |[Reverse Words in a String III](src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.java)| Easy | String, Two_Pointers | 4 | 97.75 #### Day 5 Two Pointers @@ -1250,7 +1250,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0003 |[Longest Substring Without Repeating Characters](src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 2 | 99.52 -| 0567 |[Permutation in String](src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java)| Medium | String, Hash_Table, Two_Pointers, Sliding_Window | 5 | 93.93 +| 0567 |[Permutation in String](src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java)| Medium | Top_100_Liked_Questions, String, Hash_Table, Two_Pointers, Sliding_Window | 5 | 93.93 #### Day 7 Breadth First Search Depth First Search @@ -1271,7 +1271,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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 | 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 | 3 | 74.27 #### Day 10 Recursion Backtracking @@ -1427,7 +1427,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0300 |[Longest Increasing Subsequence](src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 3 | 98.63 +| 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 | 98.63 | 0673 |[Number of Longest Increasing Subsequence](src/main/java/g0601_0700/s0673_number_of_longest_increasing_subsequence/Solution.java)| Medium | Array, Dynamic_Programming, Segment_Tree, Binary_Indexed_Tree | 25 | 68.75 #### Day 17 Dynamic Programming @@ -1441,8 +1441,8 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 4 | 90.13 -| 0322 |[Coin Change](src/main/java/g0301_0400/s0322_coin_change/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 17 | 91.77 +| 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) | 4 | 90.13 +| 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) | 17 | 91.77 | 0343 |[Integer Break](src/main/java/g0301_0400/s0343_integer_break/Solution.java)| Medium | Dynamic_Programming, Math | 0 | 100.00 #### Day 19 Bit Manipulation @@ -1455,7 +1455,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0384 |[Shuffle an Array](src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java)| Medium | Top_Interview_Questions, Array, Math, Randomized | 52 | 91.77 +| 0384 |[Shuffle an Array](src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java)| Medium | Array, Math, Randomized | 52 | 91.77 #### Day 21 Others @@ -1470,7 +1470,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00 +| 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 #### Day 2 @@ -1478,7 +1478,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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 -| 0852 |[Peak Index in a Mountain Array](src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00 +| 0852 |[Peak Index in a Mountain Array](src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java)| Medium | Array, Binary_Search | 0 | 100.00 #### Day 3 @@ -1533,7 +1533,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0350 |[Intersection of Two Arrays II](src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 4 | 69.62 +| 0350 |[Intersection of Two Arrays II](src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 4 | 69.62 | 0633 |[Sum of Square Numbers](src/main/java/g0601_0700/s0633_sum_of_square_numbers/Solution.java)| Medium | Math, Binary_Search, Two_Pointers | 4 | 82.92 #### Day 11 @@ -1569,7 +1569,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0300 |[Longest Increasing Subsequence](src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 3 | 98.63 +| 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 | 98.63 | 1760 |[Minimum Limit of Balls in a Bag](src/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag/Solution.java)| Medium | Array, Binary_Search | 44 | 78.49 #### Day 4 @@ -1583,7 +1583,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0287 |[Find the Duplicate Number](src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 2 | 99.82 +| 0287 |[Find the Duplicate Number](src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 2 | 99.82 | 1283 |[Find the Smallest Divisor Given a Threshold](src/main/java/g1201_1300/s1283_find_the_smallest_divisor_given_a_threshold/Solution.java)| Medium | Array, Binary_Search | 9 | 95.49 #### Day 6 @@ -1604,7 +1604,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0240 |[Search a 2D Matrix II](src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 7 | 86.73 +| 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) | 7 | 86.73 | 0275 |[H-Index II](src/main/java/g0201_0300/s0275_h_index_ii/Solution.java)| Medium | Array, Binary_Search | 0 | 100.00 #### Day 9 @@ -1618,7 +1618,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0222 |[Count Complete Tree Nodes](src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java)| Medium | Depth_First_Search, Tree, Binary_Search, Binary_Tree | 0 | 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 | 1712 |[Ways to Split Array Into Three Subarrays](src/main/java/g1701_1800/s1712_ways_to_split_array_into_three_subarrays/Solution.java)| Medium | Array, Binary_Search, Two_Pointers, Prefix_Sum | 16 | 84.24 #### Day 11 @@ -1726,7 +1726,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0053 |[Maximum Subarray](src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 +| 0053 |[Maximum Subarray](src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 | 0918 |[Maximum Sum Circular Subarray](src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.java)| Medium | Array, Dynamic_Programming, Divide_and_Conquer, Queue, Monotonic_Queue | 3 | 92.86 #### Day 6 @@ -1770,13 +1770,13 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 0264 |[Ugly Number II](src/main/java/g0201_0300/s0264_ugly_number_ii/Solution.java)| Medium | Hash_Table, Dynamic_Programming, Math, Heap_Priority_Queue | 2 | 99.91 -| 0096 |[Unique Binary Search Trees](src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java)| Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 +| 0096 |[Unique Binary Search Trees](src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 #### Day 12 | | | | | | |-|-|-|-|-|- -| 0118 |[Pascal's Triangle](src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08 +| 0118 |[Pascal's Triangle](src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 1 | 67.08 | 0119 |[Pascal's Triangle II](src/main/java/g0101_0200/s0119_pascals_triangle_ii/Solution.java)| Easy | Array, Dynamic_Programming | 0 | 100.00 #### Day 13 @@ -1805,7 +1805,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- | 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) | 0 | 100.00 -| 0221 |[Maximal Square](src/main/java/g0201_0300/s0221_maximal_square/Solution.java)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 7 | 72.35 +| 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) | 7 | 72.35 #### Day 17 @@ -1818,7 +1818,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' | | | | | | |-|-|-|-|-|- -| 0300 |[Longest Increasing Subsequence](src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 3 | 98.63 +| 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 | 98.63 | 0376 |[Wiggle Subsequence](src/main/java/g0301_0400/s0376_wiggle_subsequence/Solution.java)| Medium | Array, Dynamic_Programming, Greedy | 0 | 100.00 #### Day 19 @@ -1827,13 +1827,13 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' |-|-|-|-|-|- | 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers | 1 | 93.01 | 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) | 33 | 46.23 -| 0072 |[Edit Distance](src/main/java/g0001_0100/s0072_edit_distance/Solution.java)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 4 | 90.13 +| 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) | 4 | 90.13 #### Day 20 | | | | | | |-|-|-|-|-|- -| 0322 |[Coin Change](src/main/java/g0301_0400/s0322_coin_change/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 17 | 91.77 +| 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) | 17 | 91.77 | 0518 |[Coin Change 2](src/main/java/g0501_0600/s0518_coin_change_2/Solution.java)| Medium | Array, Dynamic_Programming | 4 | 84.67 #### Day 21 @@ -1842,7 +1842,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.29' |-|-|-|-|-|- | 0377 |[Combination Sum IV](src/main/java/g0301_0400/s0377_combination_sum_iv/Solution.java)| Medium | Array, Dynamic_Programming | 1 | 92.54 | 0343 |[Integer Break](src/main/java/g0301_0400/s0343_integer_break/Solution.java)| Medium | Dynamic_Programming, Math | 0 | 100.00 -| 0279 |[Perfect Squares](src/main/java/g0201_0300/s0279_perfect_squares/Solution.java)| Medium | Top_Interview_Questions, Dynamic_Programming, Math, Breadth_First_Search | 1 | 100.00 +| 0279 |[Perfect Squares](src/main/java/g0201_0300/s0279_perfect_squares/Solution.java)| Medium | Dynamic_Programming, Math, Breadth_First_Search | 1 | 100.00 ## Contributing Your ideas/fixes/algorithms are more than welcome! diff --git a/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java b/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java index 96827ab39..7d6bc60c9 100644 --- a/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java +++ b/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java @@ -1,8 +1,7 @@ package g0001_0100.s0010_regular_expression_matching; -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion -// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n) -// #2024_01_04_Time_1_ms_(100.00%)_Space_42.1_MB_(29.26%) +// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming +// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_01_04_Time_1_ms_(100.00%)_Space_42.1_MB_(29.26%) public class Solution { private Boolean[][] cache; diff --git a/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java b/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java index 5ceb183c8..7667118a3 100644 --- a/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java +++ b/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java @@ -1,6 +1,6 @@ package g0001_0100.s0013_roman_to_integer; -// #Easy #Top_Interview_Questions #String #Hash_Table #Math +// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math // #2024_02_11_Time_2_ms_(100.00%)_Space_44.5_MB_(76.62%) public class Solution { diff --git a/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java b/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java index cdd7dba57..16d6aba0d 100644 --- a/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java +++ b/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java @@ -1,7 +1,7 @@ package g0001_0100.s0014_longest_common_prefix; -// #Easy #Top_Interview_Questions #String #Level_2_Day_2_String #Udemy_Strings -// #2024_02_11_Time_0_ms_(100.00%)_Space_42_MB_(19.08%) +// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String +// #Udemy_Strings #2024_02_11_Time_0_ms_(100.00%)_Space_42_MB_(19.08%) public class Solution { public String longestCommonPrefix(String[] strs) { diff --git a/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java b/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java index a11e531ea..485aa3cf5 100644 --- a/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java +++ b/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java @@ -1,6 +1,6 @@ package g0001_0100.s0053_maximum_subarray; -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5 // #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1) // #2023_08_11_Time_1_ms_(100.00%)_Space_57.7_MB_(90.58%) diff --git a/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java b/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java index 73fc143dc..ef216c9d6 100644 --- a/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java +++ b/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java @@ -1,7 +1,7 @@ package g0001_0100.s0054_spiral_matrix; -// #Medium #Top_Interview_Questions #Array #Matrix #Simulation #Programming_Skills_II_Day_8 -// #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix +// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Simulation +// #Programming_Skills_II_Day_8 #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix // #2023_08_11_Time_0_ms_(100.00%)_Space_41_MB_(9.67%) import java.util.ArrayList; 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 471752cce..21da9da7b 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; -// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) // #2023_08_11_Time_4_ms_(90.13%)_Space_41.8_MB_(99.78%) diff --git a/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java b/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java index 7ba53c2e0..fccf3b841 100644 --- a/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java +++ b/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java @@ -1,7 +1,7 @@ package g0001_0100.s0096_unique_binary_search_trees; -// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree -// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) +// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree +// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) // #2022_06_21_Time_0_ms_(100.00%)_Space_40.4_MB_(72.43%) public class Solution { diff --git a/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java b/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java index bf524527d..71393fa4a 100644 --- a/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java +++ b/src/main/java/g0101_0200/s0118_pascals_triangle/Solution.java @@ -1,7 +1,7 @@ package g0101_0200.s0118_pascals_triangle; -// #Easy #Top_Interview_Questions #Array #Dynamic_Programming #Data_Structure_I_Day_4_Array -// #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming +// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming +// #Data_Structure_I_Day_4_Array #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming // #2022_06_23_Time_1_ms_(67.08%)_Space_42.4_MB_(5.58%) import java.util.ArrayList; diff --git a/src/main/java/g0101_0200/s0155_min_stack/MinStack.java b/src/main/java/g0101_0200/s0155_min_stack/MinStack.java index ebc36465e..d2d230262 100644 --- a/src/main/java/g0101_0200/s0155_min_stack/MinStack.java +++ b/src/main/java/g0101_0200/s0155_min_stack/MinStack.java @@ -1,6 +1,6 @@ package g0101_0200.s0155_min_stack; -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design +// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design // #Udemy_Design #Big_O_Time_O(1)_Space_O(N) #2022_06_25_Time_3_ms_(100.00%)_Space_44.3_MB_(85.39%) diff --git a/src/main/java/g0101_0200/s0164_maximum_gap/Solution.java b/src/main/java/g0101_0200/s0164_maximum_gap/Solution.java index 40015e6ac..621534f90 100644 --- a/src/main/java/g0101_0200/s0164_maximum_gap/Solution.java +++ b/src/main/java/g0101_0200/s0164_maximum_gap/Solution.java @@ -1,6 +1,6 @@ package g0101_0200.s0164_maximum_gap; -// #Hard #Array #Sorting #Bucket_Sort #Radix_Sort +// #Medium #Array #Sorting #Bucket_Sort #Radix_Sort // #2022_06_25_Time_48_ms_(53.59%)_Space_84.1_MB_(20.66%) import java.util.Arrays; 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 d1c7c14af..91bf96265 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,6 +1,6 @@ package g0101_0200.s0199_binary_tree_right_side_view; -// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree +// #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 // #2022_06_28_Time_1_ms_(94.57%)_Space_42.9_MB_(41.09%) diff --git a/src/main/java/g0201_0300/s0218_the_skyline_problem/Solution.java b/src/main/java/g0201_0300/s0218_the_skyline_problem/Solution.java index cea91b992..f265f5ef6 100644 --- a/src/main/java/g0201_0300/s0218_the_skyline_problem/Solution.java +++ b/src/main/java/g0201_0300/s0218_the_skyline_problem/Solution.java @@ -1,8 +1,7 @@ package g0201_0300.s0218_the_skyline_problem; -// #Hard #Top_Interview_Questions #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer -// #Segment_Tree #Binary_Indexed_Tree #Line_Sweep -// #2022_07_02_Time_22_ms_(76.93%)_Space_52.3_MB_(45.14%) +// #Hard #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer #Segment_Tree +// #Binary_Indexed_Tree #Line_Sweep #2022_07_02_Time_22_ms_(76.93%)_Space_52.3_MB_(45.14%) import java.util.ArrayList; import java.util.Arrays; diff --git a/src/main/java/g0201_0300/s0220_contains_duplicate_iii/Solution.java b/src/main/java/g0201_0300/s0220_contains_duplicate_iii/Solution.java index e7f4e44c8..e80d250b7 100644 --- a/src/main/java/g0201_0300/s0220_contains_duplicate_iii/Solution.java +++ b/src/main/java/g0201_0300/s0220_contains_duplicate_iii/Solution.java @@ -1,6 +1,6 @@ package g0201_0300.s0220_contains_duplicate_iii; -// #Medium #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort +// #Hard #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort // #2022_07_02_Time_38_ms_(80.90%)_Space_54.1_MB_(52.01%) import java.util.HashMap; diff --git a/src/main/java/g0201_0300/s0221_maximal_square/Solution.java b/src/main/java/g0201_0300/s0221_maximal_square/Solution.java index 813897f24..5429a80df 100644 --- a/src/main/java/g0201_0300/s0221_maximal_square/Solution.java +++ b/src/main/java/g0201_0300/s0221_maximal_square/Solution.java @@ -1,8 +1,7 @@ package g0201_0300.s0221_maximal_square; -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix -// #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n) -// #2022_07_04_Time_7_ms_(72.35%)_Space_59.5_MB_(10.55%) +// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 +// #Big_O_Time_O(m*n)_Space_O(m*n) #2022_07_04_Time_7_ms_(72.35%)_Space_59.5_MB_(10.55%) public class Solution { public int maximalSquare(char[][] matrix) { diff --git a/src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java b/src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java index 5df754f2c..fcb48141f 100644 --- a/src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java +++ b/src/main/java/g0201_0300/s0222_count_complete_tree_nodes/Solution.java @@ -1,6 +1,6 @@ package g0201_0300.s0222_count_complete_tree_nodes; -// #Medium #Depth_First_Search #Tree #Binary_Search #Binary_Tree #Binary_Search_II_Day_10 +// #Easy #Depth_First_Search #Tree #Binary_Search #Binary_Tree #Binary_Search_II_Day_10 // #2022_07_04_Time_0_ms_(100.00%)_Space_50_MB_(37.43%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java b/src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java index f344e68e2..db4b9e133 100644 --- a/src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java +++ b/src/main/java/g0201_0300/s0227_basic_calculator_ii/Solution.java @@ -1,6 +1,6 @@ package g0201_0300.s0227_basic_calculator_ii; -// #Medium #Top_Interview_Questions #String #Math #Stack #Level_2_Day_18_Stack +// #Medium #String #Math #Stack #Level_2_Day_18_Stack // #2022_07_04_Time_8_ms_(95.32%)_Space_43.6_MB_(79.36%) public class Solution { diff --git a/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java b/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java index 546fb9ad0..3bd55fa53 100644 --- a/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java +++ b/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java @@ -1,8 +1,8 @@ package g0201_0300.s0230_kth_smallest_element_in_a_bst; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree -// #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree -// #Big_O_Time_O(n)_Space_O(n) #2022_07_04_Time_1_ms_(78.91%)_Space_45.3_MB_(58.87%) +// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree +// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +// #2022_07_04_Time_1_ms_(78.91%)_Space_45.3_MB_(58.87%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java b/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java index fcdf6edb1..970994712 100644 --- a/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java +++ b/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java @@ -1,7 +1,7 @@ package g0201_0300.s0234_palindrome_linked_list; -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List -// #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) +// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion +// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) // #2022_07_04_Time_6_ms_(76.07%)_Space_97.6_MB_(56.14%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java b/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java index 8f7ed12d7..873d12c51 100644 --- a/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java +++ b/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.java @@ -1,6 +1,6 @@ package g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree; -// #Easy #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree +// #Medium #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree // #Level_1_Day_8_Binary_Search_Tree #2022_07_04_Time_4_ms_(100.00%)_Space_43.2_MB_(90.56%) import com_github_leetcode.TreeNode; 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 9ad99ad90..9152d275e 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,6 +1,6 @@ package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree +// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree // #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) // #2022_07_04_Time_10_ms_(56.51%)_Space_47.4_MB_(45.84%) diff --git a/src/main/java/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.java b/src/main/java/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.java index b83f9fa5d..bc07032ce 100644 --- a/src/main/java/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.java +++ b/src/main/java/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.java @@ -1,7 +1,6 @@ package g0201_0300.s0237_delete_node_in_a_linked_list; -// #Easy #Top_Interview_Questions #Linked_List -// #2022_07_04_Time_0_ms_(100.00%)_Space_43.8_MB_(62.83%) +// #Medium #Linked_List #2022_07_04_Time_0_ms_(100.00%)_Space_43.8_MB_(62.83%) import com_github_leetcode.ListNode; 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 d30a46a80..7082314c7 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,7 @@ package g0201_0300.s0238_product_of_array_except_self; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum -// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n) -// #2022_07_04_Time_1_ms_(100.00%)_Space_50.8_MB_(85.60%) +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays +// #Big_O_Time_O(n^2)_Space_O(n) #2022_07_04_Time_1_ms_(100.00%)_Space_50.8_MB_(85.60%) public class Solution { public int[] productExceptSelf(int[] nums) { diff --git a/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java b/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java index f3a6de1b7..1c21336bb 100644 --- a/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java +++ b/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java @@ -1,7 +1,7 @@ package g0201_0300.s0239_sliding_window_maximum; -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue -// #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k) +// #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue +// #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k) // #2022_07_04_Time_58_ms_(52.28%)_Space_145_MB_(50.60%) import java.util.LinkedList; diff --git a/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java b/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java index 316af701d..16f544693 100644 --- a/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java +++ b/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java @@ -1,8 +1,8 @@ package g0201_0300.s0240_search_a_2d_matrix_ii; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Matrix -// #Divide_and_Conquer #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 -// #Big_O_Time_O(n+m)_Space_O(1) #2022_07_04_Time_7_ms_(86.73%)_Space_58.4_MB_(9.95%) +// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer +// #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1) +// #2022_07_04_Time_7_ms_(86.73%)_Space_58.4_MB_(9.95%) public class Solution { public boolean searchMatrix(int[][] matrix, int target) { diff --git a/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java b/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java index ae4665bbb..ac9b8ef89 100644 --- a/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java +++ b/src/main/java/g0201_0300/s0242_valid_anagram/Solution.java @@ -1,6 +1,6 @@ package g0201_0300.s0242_valid_anagram; -// #Easy #Top_Interview_Questions #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String +// #Easy #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String // #Programming_Skills_I_Day_11_Containers_and_Libraries #Udemy_Strings // #2022_07_05_Time_2_ms_(99.01%)_Space_42.4_MB_(91.86%) diff --git a/src/main/java/g0201_0300/s0268_missing_number/Solution.java b/src/main/java/g0201_0300/s0268_missing_number/Solution.java index 3d14b8c13..e6ab59918 100644 --- a/src/main/java/g0201_0300/s0268_missing_number/Solution.java +++ b/src/main/java/g0201_0300/s0268_missing_number/Solution.java @@ -1,6 +1,6 @@ package g0201_0300.s0268_missing_number; -// #Easy #Top_Interview_Questions #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation +// #Easy #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation // #2022_07_05_Time_1_ms_(72.07%)_Space_50.6_MB_(76.88%) public class Solution { diff --git a/src/main/java/g0201_0300/s0279_perfect_squares/Solution.java b/src/main/java/g0201_0300/s0279_perfect_squares/Solution.java index a7eb35257..0d23726b2 100644 --- a/src/main/java/g0201_0300/s0279_perfect_squares/Solution.java +++ b/src/main/java/g0201_0300/s0279_perfect_squares/Solution.java @@ -1,7 +1,7 @@ package g0201_0300.s0279_perfect_squares; -// #Medium #Top_Interview_Questions #Dynamic_Programming #Math #Breadth_First_Search -// #Dynamic_Programming_I_Day_21 #2022_07_06_Time_1_ms_(100.00%)_Space_40.2_MB_(99.44%) +// #Medium #Dynamic_Programming #Math #Breadth_First_Search #Dynamic_Programming_I_Day_21 +// #2022_07_06_Time_1_ms_(100.00%)_Space_40.2_MB_(99.44%) public class Solution { private boolean validSquare(int n) { 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 7b23fae53..e245bced2 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 #Top_Interview_Questions #Array #Two_Pointers -// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays -// #Big_O_Time_O(n)_Space_O(1) #2022_07_06_Time_2_ms_(79.54%)_Space_55.7_MB_(5.98%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers +// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) +// #2022_07_06_Time_2_ms_(79.54%)_Space_55.7_MB_(5.98%) public class Solution { public void moveZeroes(int[] nums) { diff --git a/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java b/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java index 90274a8de..15313bfa9 100644 --- a/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java +++ b/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java @@ -1,7 +1,7 @@ package g0201_0300.s0287_find_the_duplicate_number; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers -// #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation +// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) // #2022_07_06_Time_2_ms_(99.82%)_Space_61.1_MB_(83.92%) public class Solution { diff --git a/src/main/java/g0201_0300/s0289_game_of_life/Solution.java b/src/main/java/g0201_0300/s0289_game_of_life/Solution.java index 16725178d..3c533aac3 100644 --- a/src/main/java/g0201_0300/s0289_game_of_life/Solution.java +++ b/src/main/java/g0201_0300/s0289_game_of_life/Solution.java @@ -1,7 +1,6 @@ package g0201_0300.s0289_game_of_life; -// #Medium #Top_Interview_Questions #Array #Matrix #Simulation -// #2022_07_06_Time_0_ms_(100.00%)_Space_42.9_MB_(10.73%) +// #Medium #Array #Matrix #Simulation #2022_07_06_Time_0_ms_(100.00%)_Space_42.9_MB_(10.73%) public class Solution { public void gameOfLife(int[][] board) { diff --git a/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java b/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java index 9bb2850b6..77f940a33 100644 --- a/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java +++ b/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java @@ -1,8 +1,7 @@ package g0201_0300.s0295_find_median_from_data_stream; -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design -// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n) -// #2022_07_06_Time_151_ms_(80.24%)_Space_125.2_MB_(44.11%) +// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream +// #Big_O_Time_O(n*log_n)_Space_O(n) #2022_07_06_Time_151_ms_(80.24%)_Space_125.2_MB_(44.11%) import java.util.PriorityQueue; diff --git a/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java b/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java index ba15a46c1..53bf0e0bf 100644 --- a/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java +++ b/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java @@ -1,7 +1,7 @@ package g0201_0300.s0297_serialize_and_deserialize_binary_tree; -// #Hard #Top_Interview_Questions #String #Depth_First_Search #Breadth_First_Search #Tree -// #Binary_Tree #Design #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Hard #String #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Design +// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue // #2022_07_06_Time_7_ms_(98.13%)_Space_51.1_MB_(74.13%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java b/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java index 318c619fd..f3f08143d 100644 --- a/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java +++ b/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java @@ -1,8 +1,8 @@ package g0201_0300.s0300_longest_increasing_subsequence; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 -// #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search +// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 +// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) // #2022_07_06_Time_3_ms_(98.63%)_Space_44.3_MB_(60.27%) public class Solution { diff --git a/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java b/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java index 7e0767de0..19c9ca398 100644 --- a/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java +++ b/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.java @@ -1,8 +1,7 @@ package g0301_0400.s0315_count_of_smaller_numbers_after_self; -// #Hard #Top_Interview_Questions #Array #Binary_Search #Ordered_Set #Divide_and_Conquer -// #Segment_Tree #Binary_Indexed_Tree #Merge_Sort -// #2022_07_08_Time_36_ms_(98.63%)_Space_119_MB_(77.48%) +// #Hard #Array #Binary_Search #Ordered_Set #Divide_and_Conquer #Segment_Tree #Binary_Indexed_Tree +// #Merge_Sort #2022_07_08_Time_36_ms_(98.63%)_Space_119_MB_(77.48%) import java.util.LinkedList; import java.util.List; diff --git a/src/main/java/g0301_0400/s0322_coin_change/Solution.java b/src/main/java/g0301_0400/s0322_coin_change/Solution.java index 87cac6baf..08ed75c38 100644 --- a/src/main/java/g0301_0400/s0322_coin_change/Solution.java +++ b/src/main/java/g0301_0400/s0322_coin_change/Solution.java @@ -1,7 +1,7 @@ package g0301_0400.s0322_coin_change; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 +// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search +// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 // #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) // #2022_07_09_Time_17_ms_(91.77%)_Space_41.8_MB_(95.50%) diff --git a/src/main/java/g0301_0400/s0324_wiggle_sort_ii/Solution.java b/src/main/java/g0301_0400/s0324_wiggle_sort_ii/Solution.java index e1b4046ad..5edf0b343 100644 --- a/src/main/java/g0301_0400/s0324_wiggle_sort_ii/Solution.java +++ b/src/main/java/g0301_0400/s0324_wiggle_sort_ii/Solution.java @@ -1,6 +1,6 @@ package g0301_0400.s0324_wiggle_sort_ii; -// #Medium #Top_Interview_Questions #Array #Sorting #Divide_and_Conquer #Quickselect +// #Medium #Array #Sorting #Divide_and_Conquer #Quickselect // #2022_07_09_Time_4_ms_(93.22%)_Space_46.4_MB_(85.87%) import java.util.Arrays; diff --git a/src/main/java/g0301_0400/s0326_power_of_three/Solution.java b/src/main/java/g0301_0400/s0326_power_of_three/Solution.java index 9b83f3ba3..bce7ba09a 100644 --- a/src/main/java/g0301_0400/s0326_power_of_three/Solution.java +++ b/src/main/java/g0301_0400/s0326_power_of_three/Solution.java @@ -1,7 +1,6 @@ package g0301_0400.s0326_power_of_three; -// #Easy #Top_Interview_Questions #Math #Recursion -// #2022_07_09_Time_18_ms_(85.35%)_Space_47.9_MB_(14.68%) +// #Easy #Math #Recursion #2022_07_09_Time_18_ms_(85.35%)_Space_47.9_MB_(14.68%) public class Solution { // regular method that has a loop 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 51fe31810..37ff68c0e 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 #Top_Interview_Questions #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List +// #Medium #Linked_List #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/s0329_longest_increasing_path_in_a_matrix/Solution.java b/src/main/java/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.java index dbd7c06ac..1a2e5431b 100644 --- a/src/main/java/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.java +++ b/src/main/java/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.java @@ -1,7 +1,7 @@ package g0301_0400.s0329_longest_increasing_path_in_a_matrix; -// #Hard #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search #Breadth_First_Search -// #Graph #Memoization #Topological_Sort #2022_07_09_Time_8_ms_(97.60%)_Space_54.7_MB_(19.13%) +// #Hard #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Graph #Memoization +// #Topological_Sort #2022_07_09_Time_8_ms_(97.60%)_Space_54.7_MB_(19.13%) public class Solution { public int longestIncreasingPath(int[][] matrix) { 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 a418738a9..dddcf57c4 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 #Top_Interview_Questions #Array #Greedy #Data_Structure_II_Day_5_Array +// #Medium #Array #Greedy #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 026396d95..b8020d5f9 100644 --- a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java +++ b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java @@ -1,6 +1,6 @@ package g0301_0400.s0338_counting_bits; -// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation +// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation // #Big_O_Time_O(num)_Space_O(num) #2022_07_10_Time_2_ms_(86.73%)_Space_48.3_MB_(31.59%) public class Solution { diff --git a/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java b/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java index bfadc4626..0ccf48315 100644 --- a/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java +++ b/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java @@ -1,7 +1,7 @@ package g0301_0400.s0341_flatten_nested_list_iterator; -// #Medium #Top_Interview_Questions #Depth_First_Search #Tree #Stack #Design #Queue #Iterator -// #Programming_Skills_II_Day_18 #2022_07_10_Time_2_ms_(99.95%)_Space_43.2_MB_(94.14%) +// #Medium #Depth_First_Search #Tree #Stack #Design #Queue #Iterator #Programming_Skills_II_Day_18 +// #2022_07_10_Time_2_ms_(99.95%)_Space_43.2_MB_(94.14%) import com_github_leetcode.NestedInteger; import java.util.ArrayDeque; diff --git a/src/main/java/g0301_0400/s0344_reverse_string/Solution.java b/src/main/java/g0301_0400/s0344_reverse_string/Solution.java index 2fdd48866..1934ec654 100644 --- a/src/main/java/g0301_0400/s0344_reverse_string/Solution.java +++ b/src/main/java/g0301_0400/s0344_reverse_string/Solution.java @@ -1,7 +1,7 @@ package g0301_0400.s0344_reverse_string; -// #Easy #Top_Interview_Questions #String #Two_Pointers #Recursion #Algorithm_I_Day_4_Two_Pointers -// #Udemy_Strings #2022_07_11_Time_1_ms_(99.91%)_Space_54.4_MB_(64.26%) +// #Easy #String #Two_Pointers #Recursion #Algorithm_I_Day_4_Two_Pointers #Udemy_Strings +// #2022_07_11_Time_1_ms_(99.91%)_Space_54.4_MB_(64.26%) public class Solution { public void reverseString(char[] s) { diff --git a/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java b/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java index a95143c4d..cfed3d555 100644 --- a/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java +++ b/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java @@ -1,9 +1,8 @@ package g0301_0400.s0347_top_k_frequent_elements; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting -// #Heap_Priority_Queue #Counting #Divide_and_Conquer #Quickselect #Bucket_Sort -// #Data_Structure_II_Day_20_Heap_Priority_Queue #Big_O_Time_O(n*log(n))_Space_O(k) -// #2022_07_11_Time_9_ms_(97.93%)_Space_48.5_MB_(83.34%) +// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting +// #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue +// #Big_O_Time_O(n*log(n))_Space_O(k) #2022_07_11_Time_9_ms_(97.93%)_Space_48.5_MB_(83.34%) import java.util.Arrays; import java.util.PriorityQueue; diff --git a/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java b/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java index e54dc961a..7bdc350f7 100644 --- a/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java +++ b/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java @@ -1,8 +1,7 @@ package g0301_0400.s0350_intersection_of_two_arrays_ii; -// #Easy #Top_Interview_Questions #Array #Hash_Table #Sorting #Binary_Search #Two_Pointers -// #Data_Structure_I_Day_3_Array #Binary_Search_I_Day_10 -// #2022_07_11_Time_4_ms_(69.62%)_Space_42.3_MB_(92.20%) +// #Easy #Array #Hash_Table #Sorting #Binary_Search #Two_Pointers #Data_Structure_I_Day_3_Array +// #Binary_Search_I_Day_10 #2022_07_11_Time_4_ms_(69.62%)_Space_42.3_MB_(92.20%) import java.util.Arrays; diff --git a/src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java b/src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java index 174044cd1..0152d1afe 100644 --- a/src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java +++ b/src/main/java/g0301_0400/s0371_sum_of_two_integers/Solution.java @@ -1,6 +1,6 @@ package g0301_0400.s0371_sum_of_two_integers; -// #Medium #Top_Interview_Questions #Math #Bit_Manipulation #Udemy_Bit_Manipulation +// #Medium #Math #Bit_Manipulation #Udemy_Bit_Manipulation // #2022_07_12_Time_0_ms_(100.00%)_Space_40.3_MB_(77.27%) public class Solution { diff --git a/src/main/java/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.java b/src/main/java/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.java index ebe3d632a..545c5780d 100644 --- a/src/main/java/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.java +++ b/src/main/java/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.java @@ -1,6 +1,6 @@ package g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix; -// #Medium #Top_Interview_Questions #Array #Sorting #Binary_Search #Matrix #Heap_Priority_Queue +// #Medium #Array #Sorting #Binary_Search #Matrix #Heap_Priority_Queue // #2022_07_13_Time_1_ms_(92.14%)_Space_58_MB_(9.74%) public class Solution { diff --git a/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java b/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java index a739d24ec..118a90160 100644 --- a/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java +++ b/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.java @@ -1,7 +1,7 @@ package g0301_0400.s0380_insert_delete_getrandom_o1; -// #Medium #Top_Interview_Questions #Array #Hash_Table #Math #Design #Randomized -// #Programming_Skills_II_Day_20 #2022_07_13_Time_27_ms_(93.44%)_Space_92.2_MB_(91.11%) +// #Medium #Array #Hash_Table #Math #Design #Randomized #Programming_Skills_II_Day_20 +// #2022_07_13_Time_27_ms_(93.44%)_Space_92.2_MB_(91.11%) import java.util.ArrayList; import java.util.HashMap; diff --git a/src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java b/src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java index 70aee2586..156fb276d 100644 --- a/src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java +++ b/src/main/java/g0301_0400/s0384_shuffle_an_array/Solution.java @@ -1,6 +1,6 @@ package g0301_0400.s0384_shuffle_an_array; -// #Medium #Top_Interview_Questions #Array #Math #Randomized #Algorithm_II_Day_20_Others +// #Medium #Array #Math #Randomized #Algorithm_II_Day_20_Others // #2022_07_13_Time_52_ms_(91.77%)_Space_48.2_MB_(92.20%) import java.util.Random; diff --git a/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java b/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java index 498a5e0ad..e7eb8d0f8 100644 --- a/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java +++ b/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string/Solution.java @@ -1,7 +1,7 @@ package g0301_0400.s0387_first_unique_character_in_a_string; -// #Easy #Top_Interview_Questions #String #Hash_Table #Counting #Queue -// #Data_Structure_I_Day_6_String #2022_07_13_Time_1_ms_(100.00%)_Space_42.9_MB_(86.44%) +// #Easy #String #Hash_Table #Counting #Queue #Data_Structure_I_Day_6_String +// #2022_07_13_Time_1_ms_(100.00%)_Space_42.9_MB_(86.44%) public class Solution { public int firstUniqChar(String s) { diff --git a/src/main/java/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.java b/src/main/java/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.java index 70620244d..27c23db77 100644 --- a/src/main/java/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.java +++ b/src/main/java/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.java @@ -1,6 +1,6 @@ package g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters; -// #Medium #Top_Interview_Questions #String #Hash_Table #Sliding_Window #Divide_and_Conquer +// #Medium #String #Hash_Table #Sliding_Window #Divide_and_Conquer // #2022_07_15_Time_0_ms_(100.00%)_Space_42.4_MB_(47.47%) public class Solution { diff --git a/src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java b/src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java index ffea009a7..718bf550e 100644 --- a/src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java +++ b/src/main/java/g0401_0500/s0412_fizz_buzz/Solution.java @@ -1,6 +1,6 @@ package g0401_0500.s0412_fizz_buzz; -// #Easy #Top_Interview_Questions #String #Math #Simulation #Udemy_Integers +// #Easy #String #Math #Simulation #Udemy_Integers // #2022_07_16_Time_1_ms_(100.00%)_Space_48.4_MB_(48.76%) import java.util.ArrayList; 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 bd3e72354..c6ea4ebc1 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 #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree -// #Big_O_Time_O(n)_Space_O(n) #2022_07_16_Time_18_ms_(45.66%)_Space_42_MB_(88.96%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) +// #2022_07_16_Time_18_ms_(45.66%)_Space_42_MB_(88.96%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0401_0500/s0454_4sum_ii/Solution.java b/src/main/java/g0401_0500/s0454_4sum_ii/Solution.java index cb6488011..c76fcfacf 100644 --- a/src/main/java/g0401_0500/s0454_4sum_ii/Solution.java +++ b/src/main/java/g0401_0500/s0454_4sum_ii/Solution.java @@ -1,7 +1,6 @@ package g0401_0500.s0454_4sum_ii; -// #Medium #Top_Interview_Questions #Array #Hash_Table -// #2022_07_18_Time_133_ms_(95.19%)_Space_42.4_MB_(88.53%) +// #Medium #Array #Hash_Table #2022_07_18_Time_133_ms_(95.19%)_Space_42.4_MB_(88.53%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g0401_0500/s0494_target_sum/Solution.java b/src/main/java/g0401_0500/s0494_target_sum/Solution.java index bcda7efcb..8532aba86 100644 --- a/src/main/java/g0401_0500/s0494_target_sum/Solution.java +++ b/src/main/java/g0401_0500/s0494_target_sum/Solution.java @@ -1,7 +1,6 @@ package g0401_0500.s0494_target_sum; -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking -// #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +// #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) // #2022_07_21_Time_9_ms_(79.99%)_Space_45.2_MB_(32.79%) public class Solution { diff --git a/src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java b/src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java index 9b789785f..e47efdc0c 100644 --- a/src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java +++ b/src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java @@ -1,7 +1,7 @@ package g0501_0600.s0567_permutation_in_string; -// #Medium #String #Hash_Table #Two_Pointers #Sliding_Window #Algorithm_I_Day_6_Sliding_Window -// #2022_08_10_Time_5_ms_(93.93%)_Space_43.1_MB_(71.37%) +// #Medium #Top_100_Liked_Questions #String #Hash_Table #Two_Pointers #Sliding_Window +// #Algorithm_I_Day_6_Sliding_Window #2022_08_10_Time_5_ms_(93.93%)_Space_43.1_MB_(71.37%) public class Solution { public boolean checkInclusion(String s1, String s2) { diff --git a/src/main/java/g0601_0700/s0606_construct_string_from_binary_tree/Solution.java b/src/main/java/g0601_0700/s0606_construct_string_from_binary_tree/Solution.java index f0562491e..fb5a5a268 100644 --- a/src/main/java/g0601_0700/s0606_construct_string_from_binary_tree/Solution.java +++ b/src/main/java/g0601_0700/s0606_construct_string_from_binary_tree/Solution.java @@ -1,6 +1,6 @@ package g0601_0700.s0606_construct_string_from_binary_tree; -// #Easy #String #Depth_First_Search #Tree #Binary_Tree +// #Medium #String #Depth_First_Search #Tree #Binary_Tree // #2022_03_21_Time_1_ms_(100.00%)_Space_42.3_MB_(91.51%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java b/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java index cd00af5a6..c9cedb812 100644 --- a/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java +++ b/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java @@ -1,6 +1,6 @@ package g0601_0700.s0647_palindromic_substrings; -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) // #2022_03_21_Time_2_ms_(98.77%)_Space_41.7_MB_(75.10%) public class Solution { diff --git a/src/main/java/g0701_0800/s0704_binary_search/Solution.java b/src/main/java/g0701_0800/s0704_binary_search/Solution.java index 5ecd37b24..34d252dfd 100644 --- a/src/main/java/g0701_0800/s0704_binary_search/Solution.java +++ b/src/main/java/g0701_0800/s0704_binary_search/Solution.java @@ -1,7 +1,7 @@ package g0701_0800.s0704_binary_search; -// #Easy #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search #Binary_Search_I_Day_1 -// #Level_1_Day_7_Binary_Search #Udemy_Binary_Search +// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search +// #Binary_Search_I_Day_1 #Level_1_Day_7_Binary_Search #Udemy_Binary_Search // #2022_03_23_Time_0_ms_(100.00%)_Space_54.8_MB_(20.10%) public class Solution { diff --git a/src/main/java/g0701_0800/s0763_partition_labels/Solution.java b/src/main/java/g0701_0800/s0763_partition_labels/Solution.java index 26442e97d..277b25d8e 100644 --- a/src/main/java/g0701_0800/s0763_partition_labels/Solution.java +++ b/src/main/java/g0701_0800/s0763_partition_labels/Solution.java @@ -1,8 +1,7 @@ package g0701_0800.s0763_partition_labels; -// #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers -// #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1) -// #2022_03_26_Time_1_ms_(100.00%)_Space_40.3_MB_(98.19%) +// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String +// #Big_O_Time_O(n)_Space_O(1) #2022_03_26_Time_1_ms_(100.00%)_Space_40.3_MB_(98.19%) import java.util.ArrayList; import java.util.List; diff --git a/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java b/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java index 7ed7c6e92..83fc831f4 100644 --- a/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java +++ b/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java @@ -1,6 +1,6 @@ package g0801_0900.s0852_peak_index_in_a_mountain_array; -// #Easy #Array #Binary_Search #Binary_Search_I_Day_2 +// #Medium #Array #Binary_Search #Binary_Search_I_Day_2 // #2022_03_28_Time_0_ms_(100.00%)_Space_46.1_MB_(68.36%) public class Solution { diff --git a/src/main/java/g0901_1000/s0937_reorder_data_in_log_files/Solution.java b/src/main/java/g0901_1000/s0937_reorder_data_in_log_files/Solution.java index 8bd94b3a4..7f9cd627f 100644 --- a/src/main/java/g0901_1000/s0937_reorder_data_in_log_files/Solution.java +++ b/src/main/java/g0901_1000/s0937_reorder_data_in_log_files/Solution.java @@ -1,6 +1,6 @@ package g0901_1000.s0937_reorder_data_in_log_files; -// #Easy #Array #String #Sorting #2022_03_30_Time_4_ms_(92.15%)_Space_46_MB_(66.46%) +// #Medium #Array #String #Sorting #2022_03_30_Time_4_ms_(92.15%)_Space_46_MB_(66.46%) import java.util.ArrayList; import java.util.List; 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 a67f5a4a3..01fe749bc 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 #Array #Breadth_First_Search #Matrix +// #Medium #Top_100_Liked_Questions #Array #Breadth_First_Search #Matrix // #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/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.java b/src/main/java/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.java index a2a8d2e98..dfaab970d 100644 --- a/src/main/java/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.java +++ b/src/main/java/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.java @@ -1,6 +1,6 @@ package g1401_1500.s1441_build_an_array_with_stack_operations; -// #Easy #Array #Stack #Simulation #2022_03_28_Time_1_ms_(38.47%)_Space_43.3_MB_(57.71%) +// #Medium #Array #Stack #Simulation #2022_03_28_Time_1_ms_(38.47%)_Space_43.3_MB_(57.71%) import java.util.ArrayList; import java.util.HashSet; diff --git a/src/main/java/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.java b/src/main/java/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.java index d9095745a..d9a6432cf 100644 --- a/src/main/java/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.java +++ b/src/main/java/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.java @@ -1,6 +1,6 @@ package g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points; -// #Medium #Array #Sorting #2022_04_20_Time_17_ms_(74.19%)_Space_78.6_MB_(62.28%) +// #Easy #Array #Sorting #2022_04_20_Time_17_ms_(74.19%)_Space_78.6_MB_(62.28%) import java.util.Arrays; diff --git a/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.java b/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.java index afcbdf92f..f34c1ebeb 100644 --- a/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.java +++ b/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.java @@ -1,6 +1,6 @@ package g1701_1800.s1770_maximum_score_from_performing_multiplication_operations; -// #Medium #Array #Dynamic_Programming #2022_04_30_Time_31_ms_(92.41%)_Space_53.2_MB_(88.74%) +// #Hard #Array #Dynamic_Programming #2022_04_30_Time_31_ms_(92.41%)_Space_53.2_MB_(88.74%) public class Solution { public int maximumScore(int[] nums, int[] mult) { diff --git a/src/main/java/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.java b/src/main/java/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.java index d7376109c..a5fc3cbb1 100644 --- a/src/main/java/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.java +++ b/src/main/java/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.java @@ -1,6 +1,6 @@ package g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i; -// #Medium #Array #String #Dynamic_Programming #Greedy +// #Easy #Array #String #Dynamic_Programming #Greedy // #2023_12_20_Time_1_ms_(100.00%)_Space_45_MB_(7.16%) import java.util.ArrayList;