diff --git a/README.md b/README.md index 9880184e5..a16fec03b 100644 --- a/README.md +++ b/README.md @@ -34,6 +34,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.33' > ["For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."](https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews) ## +* [Data Structure II](#data-structure-ii) * [Algorithm I](#algorithm-i) * [Algorithm II](#algorithm-ii) * [Binary Search I](#binary-search-i) @@ -46,8 +47,165 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.33' * [Level 1](#level-1) * [Level 2](#level-2) * [Udemy](#udemy) +* [Top Interview 150](#top-interview-150) * [Data Structure I](#data-structure-i) -* [Data Structure II](#data-structure-ii) + +### Data Structure II + +#### Day 1 Array + +| | | | | | +|-|-|-|-|-|- +| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 +| 0169 |[Majority Element](src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 460 | 51.25 +| 0015 |[3Sum](src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 493 | 93.45 + +#### Day 2 Array + +| | | | | | +|-|-|-|-|-|- +| 0075 |[Sort Colors](src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 164 | 64.43 +| 0056 |[Merge Intervals](src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 334 | 80.67 +| 0706 |[Design HashMap](src/main/kotlin/g0701_0800/s0706_design_hashmap/MyHashMap.kt)| Easy | Array, Hash_Table, Design, Linked_List, Hash_Function | 405 | 92.11 + +#### Day 3 Array + +| | | | | | +|-|-|-|-|-|- +| 0119 |[Pascal's Triangle II](src/main/kotlin/g0101_0200/s0119_pascals_triangle_ii/Solution.kt)| Easy | Array, Dynamic_Programming | 157 | 97.27 +| 0048 |[Rotate Image](src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 160 | 90.11 +| 0059 |[Spiral Matrix II](src/main/kotlin/g0001_0100/s0059_spiral_matrix_ii/Solution.kt)| Medium | Array, Matrix, Simulation | 153 | 41.70 + +#### Day 4 Array + +| | | | | | +|-|-|-|-|-|- +| 0240 |[Search a 2D Matrix II](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 460 | 66.08 +| 0435 |[Non-overlapping Intervals](src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt)| Medium | Array, Dynamic_Programming, Sorting, Greedy | 1040 | 85.07 + +#### Day 5 Array + +| | | | | | +|-|-|-|-|-|- +| 0334 |[Increasing Triplet Subsequence](src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt)| Medium | Array, Greedy | 672 | 60.61 +| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 +| 0560 |[Subarray Sum Equals K](src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 692 | 53.27 + +#### Day 6 String + +| | | | | | +|-|-|-|-|-|- +| 0415 |[Add Strings](src/main/kotlin/g0401_0500/s0415_add_strings/Solution.kt)| Easy | String, Math, Simulation | 296 | 76.00 +| 0409 |[Longest Palindrome](src/main/kotlin/g0401_0500/s0409_longest_palindrome/Solution.kt)| Easy | String, Hash_Table, Greedy | 259 | 60.71 + +#### Day 7 String + +| | | | | | +|-|-|-|-|-|- +| 0290 |[Word Pattern](src/main/kotlin/g0201_0300/s0290_word_pattern/Solution.kt)| Easy | String, Hash_Table | 177 | 89.55 +| 0763 |[Partition Labels](src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt)| Medium | String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 235 | 84.75 + +#### Day 8 String + +| | | | | | +|-|-|-|-|-|- +| 0049 |[Group Anagrams](src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 308 | 96.34 +| 0043 |[Multiply Strings](src/main/kotlin/g0001_0100/s0043_multiply_strings/Solution.kt)| Medium | String, Math, Simulation | 165 | 96.72 + +#### Day 9 String + +| | | | | | +|-|-|-|-|-|- +| 0187 |[Repeated DNA Sequences](src/main/kotlin/g0101_0200/s0187_repeated_dna_sequences/Solution.kt)| Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 319 | 79.03 +| 0005 |[Longest Palindromic Substring](src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 162 | 99.00 + +#### Day 10 Linked List + +| | | | | | +|-|-|-|-|-|- +| 0002 |[Add Two Numbers](src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 203 | 96.13 +| 0142 |[Linked List Cycle II](src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 192 | 63.39 + +#### Day 11 Linked List + +| | | | | | +|-|-|-|-|-|- +| 0160 |[Intersection of Two Linked Lists](src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 262 | 83.50 +| 0082 |[Remove Duplicates from Sorted List II](src/main/kotlin/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.kt)| Medium | Two_Pointers, Linked_List | 166 | 89.47 + +#### Day 12 Linked List + +| | | | | | +|-|-|-|-|-|- +| 0024 |[Swap Nodes in Pairs](src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 149 | 44.20 +| 0707 |[Design Linked List](src/main/kotlin/g0701_0800/s0707_design_linked_list/MyLinkedList.kt)| Medium | Design, Linked_List | 243 | 100.00 + +#### Day 13 Linked List + +| | | | | | +|-|-|-|-|-|- +| 0025 |[Reverse Nodes in k-Group](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 189 | 67.03 +| 0143 |[Reorder List](src/main/kotlin/g0101_0200/s0143_reorder_list/Solution.kt)| Medium | Two_Pointers, Stack, Linked_List, Recursion | 395 | 82.26 + +#### Day 14 Stack Queue + +| | | | | | +|-|-|-|-|-|- +| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88 +| 1249 |[Minimum Remove to Make Valid Parentheses](src/main/kotlin/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses/Solution.kt)| Medium | String, Stack | 218 | 100.00 +| 1823 |[Find the Winner of the Circular Game](src/main/kotlin/g1801_1900/s1823_find_the_winner_of_the_circular_game/Solution.kt)| Medium | Array, Math, Simulation, Recursion, Queue | 119 | 87.50 + +#### Day 15 Tree + +| | | | | | +|-|-|-|-|-|- +| 0108 |[Convert Sorted Array to Binary Search Tree](src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 167 | 80.29 +| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 183 | 95.45 +| 0103 |[Binary Tree Zigzag Level Order Traversal](src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 176 | 71.62 + +#### Day 16 Tree + +| | | | | | +|-|-|-|-|-|- +| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 +| 0113 |[Path Sum II](src/main/kotlin/g0101_0200/s0113_path_sum_ii/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking | 364 | 78.67 +| 0450 |[Delete Node in a BST](src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 257 | 84.62 + +#### Day 17 Tree + +| | | | | | +|-|-|-|-|-|- +| 0230 |[Kth Smallest Element in a BST](src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 393 | 33.33 +| 0173 |[Binary Search Tree Iterator](src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt)| Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 563 | 46.91 + +#### Day 18 Tree + +| | | | | | +|-|-|-|-|-|- +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 +| 0297 |[Serialize and Deserialize Binary Tree](src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt)| Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85 + +#### Day 19 Graph + +| | | | | | +|-|-|-|-|-|- +| 0997 |[Find the Town Judge](src/main/kotlin/g0901_1000/s0997_find_the_town_judge/Solution.kt)| Easy | Array, Hash_Table, Graph | 475 | 58.62 +| 1557 |[Minimum Number of Vertices to Reach All Nodes](src/main/kotlin/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.kt)| Medium | Graph | 792 | 99.29 +| 0841 |[Keys and Rooms](src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 189 | 69.23 + +#### Day 20 Heap Priority Queue + +| | | | | | +|-|-|-|-|-|- +| 0215 |[Kth Largest Element in an Array](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 839 | 34.43 +| 0347 |[Top K Frequent Elements](src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n\*log(n))_Space_O(k) | 268 | 99.74 + +#### Day 21 Heap Priority Queue + +| | | | | | +|-|-|-|-|-|- +| 0451 |[Sort Characters By Frequency](src/main/kotlin/g0401_0500/s0451_sort_characters_by_frequency/Solution.kt)| Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Bucket_Sort | 288 | 81.72 +| 0973 |[K Closest Points to Origin](src/main/kotlin/g0901_1000/s0973_k_closest_points_to_origin/Solution.kt)| Medium | Array, Math, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Geometry, Quickselect | 800 | 37.89 ### Algorithm I @@ -1582,267 +1740,377 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.33' |-|-|-|-|-|- | 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88 -### Data Structure I - -#### Day 1 Array - -| | | | | | -|-|-|-|-|-|- -| 0217 |[Contains Duplicate](src/main/kotlin/g0201_0300/s0217_contains_duplicate/Solution.kt)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49 -| 0053 |[Maximum Subarray](src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81 +### Top Interview 150 -#### Day 2 Array +#### Top Interview 150 Array/String | | | | | | |-|-|-|-|-|- -| 0001 |[Two Sum](src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 202 | 91.18 | 0088 |[Merge Sorted Array](src/main/kotlin/g0001_0100/s0088_merge_sorted_array/Solution.kt)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 170 | 69.74 +| 0027 |[Remove Element](src/main/kotlin/g0001_0100/s0027_remove_element/Solution.kt)| Easy | Array, Two_Pointers | 162 | 76.44 +| 0026 |[Remove Duplicates from Sorted Array](src/main/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.kt)| Easy | Top_Interview_Questions, Array, Two_Pointers | 249 | 67.38 +| 0080 |[Remove Duplicates from Sorted Array II](src/main/kotlin/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.kt)| Medium | Array, Two_Pointers | 192 | 80.67 +| 0169 |[Majority Element](src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 460 | 51.25 +| 0189 |[Rotate Array](src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 483 | 86.95 +| 0121 |[Best Time to Buy and Sell Stock](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 609 | 94.06 +| 0122 |[Best Time to Buy and Sell Stock II](src/main/kotlin/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.kt)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 197 | 95.10 +| 0055 |[Jump Game](src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 332 | 89.35 +| 0045 |[Jump Game II](src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 208 | 93.37 +| 0274 |[H-Index](src/main/kotlin/g0201_0300/s0274_h_index/Solution.kt)| Medium | Array, Sorting, Counting_Sort | 291 | 45.45 +| 0380 |[Insert Delete GetRandom O(1)](src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.kt)| Medium | Array, Hash_Table, Math, Design, Randomized | 1326 | 68.23 +| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 +| 0134 |[Gas Station](src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt)| Medium | Top_Interview_Questions, Array, Greedy | 545 | 70.18 +| 0135 |[Candy](src/main/kotlin/g0101_0200/s0135_candy/Solution.kt)| Hard | Array, Greedy | 466 | 58.33 +| 0042 |[Trapping Rain Water](src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 189 | 99.37 +| 0013 |[Roman to Integer](src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Math | 211 | 83.47 +| 0012 |[Integer to Roman](src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt)| Medium | String, Hash_Table, Math | 180 | 98.25 +| 0058 |[Length of Last Word](src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt)| Easy | String | 135 | 93.67 +| 0014 |[Longest Common Prefix](src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String | 154 | 89.70 +| 0151 |[Reverse Words in a String](src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt)| Medium | String, Two_Pointers | 206 | 98.90 +| 0006 |[Zigzag Conversion](src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt)| Medium | String | 200 | 97.79 +| 0028 |[Find the Index of the First Occurrence in a String](src/main/kotlin/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers, String_Matching | 126 | 97.58 +| 0068 |[Text Justification](src/main/kotlin/g0001_0100/s0068_text_justification/Solution.kt)| Hard | Array, String, Simulation | 153 | 92.96 -#### Day 3 Array +#### Top Interview 150 Two Pointers | | | | | | |-|-|-|-|-|- -| 0350 |[Intersection of Two Arrays II](src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 321 | 73.37 -| 0121 |[Best Time to Buy and Sell Stock](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 609 | 94.06 +| 0125 |[Valid Palindrome](src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers | 353 | 52.06 +| 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers | 156 | 87.74 +| 0167 |[Two Sum II - Input Array Is Sorted](src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt)| Medium | Array, Binary_Search, Two_Pointers | 403 | 68.74 +| 0011 |[Container With Most Water](src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 402 | 78.57 +| 0015 |[3Sum](src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 493 | 93.45 -#### Day 4 Array +#### Top Interview 150 Sliding Window | | | | | | |-|-|-|-|-|- -| 0566 |[Reshape the Matrix](src/main/kotlin/g0501_0600/s0566_reshape_the_matrix/Solution.kt)| Easy | Array, Matrix, Simulation | 239 | 99.05 -| 0118 |[Pascal's Triangle](src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22 +| 0209 |[Minimum Size Subarray Sum](src/main/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/Solution.kt)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 315 | 96.73 +| 0003 |[Longest Substring Without Repeating Characters](src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 201 | 87.28 +| 0030 |[Substring with Concatenation of All Words](src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt)| Hard | String, Hash_Table, Sliding_Window | 182 | 100.00 +| 0076 |[Minimum Window Substring](src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 191 | 96.38 -#### Day 5 Array +#### Top Interview 150 Matrix | | | | | | |-|-|-|-|-|- | 0036 |[Valid Sudoku](src/main/kotlin/g0001_0100/s0036_valid_sudoku/Solution.kt)| Medium | Top_Interview_Questions, Array, Hash_Table, Matrix | 181 | 95.15 -| 0074 |[Search a 2D Matrix](src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 159 | 74.46 +| 0054 |[Spiral Matrix](src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 132 | 95.12 +| 0048 |[Rotate Image](src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 160 | 90.11 +| 0073 |[Set Matrix Zeroes](src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m\*n)_Space_O(1) | 248 | 97.33 +| 0289 |[Game of Life](src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt)| Medium | Array, Matrix, Simulation | 174 | 96.97 -#### Day 6 String +#### Top Interview 150 Hashmap | | | | | | |-|-|-|-|-|- -| 0387 |[First Unique Character in a String](src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt)| Easy | String, Hash_Table, Counting, Queue | 369 | 82.68 | 0383 |[Ransom Note](src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt)| Easy | String, Hash_Table, Counting | 333 | 79.58 +| 0205 |[Isomorphic Strings](src/main/kotlin/g0201_0300/s0205_isomorphic_strings/Solution.kt)| Easy | String, Hash_Table | 278 | 79.96 +| 0290 |[Word Pattern](src/main/kotlin/g0201_0300/s0290_word_pattern/Solution.kt)| Easy | String, Hash_Table | 177 | 89.55 | 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | String, Hash_Table, Sorting | 251 | 87.65 +| 0049 |[Group Anagrams](src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 308 | 96.34 +| 0001 |[Two Sum](src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 202 | 91.18 +| 0202 |[Happy Number](src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 261 | 45.08 +| 0219 |[Contains Duplicate II](src/main/kotlin/g0201_0300/s0219_contains_duplicate_ii/Solution.kt)| Easy | Array, Hash_Table, Sliding_Window | 813 | 80.46 +| 0128 |[Longest Consecutive Sequence](src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Big_O_Time_O(N_log_N)_Space_O(1) | 460 | 97.77 -#### Day 7 Linked List +#### Top Interview 150 Intervals | | | | | | |-|-|-|-|-|- -| 0141 |[Linked List Cycle](src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 223 | 91.85 -| 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24 -| 0203 |[Remove Linked List Elements](src/main/kotlin/g0201_0300/s0203_remove_linked_list_elements/Solution.kt)| Easy | Linked_List, Recursion | 233 | 91.22 +| 0228 |[Summary Ranges](src/main/kotlin/g0201_0300/s0228_summary_ranges/Solution.kt)| Easy | Array | 169 | 91.89 +| 0056 |[Merge Intervals](src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 334 | 80.67 +| 0057 |[Insert Interval](src/main/kotlin/g0001_0100/s0057_insert_interval/Solution.kt)| Medium | Array | 249 | 75.63 +| 0452 |[Minimum Number of Arrows to Burst Balloons](src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt)| Medium | Array, Sorting, Greedy | 934 | 100.00 -#### Day 8 Linked List +#### Top Interview 150 Stack | | | | | | |-|-|-|-|-|- -| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 -| 0083 |[Remove Duplicates from Sorted List](src/main/kotlin/g0001_0100/s0083_remove_duplicates_from_sorted_list/Solution.kt)| Easy | Linked_List | 173 | 82.42 +| 0020 |[Valid Parentheses](src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 137 | 88.76 +| 0071 |[Simplify Path](src/main/kotlin/g0001_0100/s0071_simplify_path/Solution.kt)| Medium | String, Stack | 185 | 92.86 +| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88 +| 0150 |[Evaluate Reverse Polish Notation](src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt)| Medium | Top_Interview_Questions, Array, Math, Stack | 233 | 88.82 +| 0224 |[Basic Calculator](src/main/kotlin/g0201_0300/s0224_basic_calculator/Solution.kt)| Hard | String, Math, Stack, Recursion | 294 | 93.33 -#### Day 9 Stack Queue +#### Top Interview 150 Linked List | | | | | | |-|-|-|-|-|- -| 0020 |[Valid Parentheses](src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 137 | 88.76 -| 0232 |[Implement Queue using Stacks](src/main/kotlin/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.kt)| Easy | Stack, Design, Queue | 258 | 70.86 +| 0141 |[Linked List Cycle](src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 223 | 91.85 +| 0002 |[Add Two Numbers](src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 203 | 96.13 +| 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24 +| 0138 |[Copy List with Random Pointer](src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 274 | 80.58 +| 0092 |[Reverse Linked List II](src/main/kotlin/g0001_0100/s0092_reverse_linked_list_ii/Solution.kt)| Medium | Linked_List | 144 | 75.00 +| 0025 |[Reverse Nodes in k-Group](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 189 | 67.03 +| 0019 |[Remove Nth Node From End of List](src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 144 | 96.28 +| 0082 |[Remove Duplicates from Sorted List II](src/main/kotlin/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.kt)| Medium | Two_Pointers, Linked_List | 166 | 89.47 +| 0061 |[Rotate List](src/main/kotlin/g0001_0100/s0061_rotate_list/Solution.kt)| Medium | Two_Pointers, Linked_List | 160 | 92.22 +| 0086 |[Partition List](src/main/kotlin/g0001_0100/s0086_partition_list/Solution.kt)| Medium | Two_Pointers, Linked_List | 160 | 70.73 +| 0146 |[LRU Cache](src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 1116 | 97.93 -#### Day 10 Tree +#### Top Interview 150 Binary Tree General | | | | | | |-|-|-|-|-|- -| 0144 |[Binary Tree Preorder Traversal](src/main/kotlin/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.kt)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 277 | 37.90 -| 0094 |[Binary Tree Inorder Traversal](src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 152 | 66.67 -| 0145 |[Binary Tree Postorder Traversal](src/main/kotlin/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.kt)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 211 | 80.00 +| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 +| 0100 |[Same Tree](src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 134 | 86.63 +| 0226 |[Invert Binary Tree](src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 233 | 54.90 +| 0101 |[Symmetric Tree](src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35 +| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 183 | 95.45 +| 0106 |[Construct Binary Tree from Inorder and Postorder Traversal](src/main/kotlin/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.kt)| Medium | Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer | 167 | 100.00 +| 0117 |[Populating Next Right Pointers in Each Node II](src/main/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 199 | 94.67 +| 0114 |[Flatten Binary Tree to Linked List](src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 191 | 93.10 +| 0112 |[Path Sum](src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 322 | 36.41 +| 0129 |[Sum Root to Leaf Numbers](src/main/kotlin/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree | 237 | 52.50 +| 0124 |[Binary Tree Maximum Path Sum](src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 331 | 74.42 +| 0173 |[Binary Search Tree Iterator](src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt)| Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 563 | 46.91 +| 0222 |[Count Complete Tree Nodes](src/main/kotlin/g0201_0300/s0222_count_complete_tree_nodes/Solution.kt)| ||| +| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 -#### Day 11 Tree +#### Top Interview 150 Binary Tree BFS | | | | | | |-|-|-|-|-|- +| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 +| 0637 |[Average of Levels in Binary Tree](src/main/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 249 | 100.00 | 0102 |[Binary Tree Level Order Traversal](src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 198 | 95.14 -| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 -| 0101 |[Symmetric Tree](src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35 +| 0103 |[Binary Tree Zigzag Level Order Traversal](src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 176 | 71.62 -#### Day 12 Tree +#### Top Interview 150 Binary Search Tree | | | | | | |-|-|-|-|-|- -| 0226 |[Invert Binary Tree](src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 233 | 54.90 -| 0112 |[Path Sum](src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 322 | 36.41 +| 0530 |[Minimum Absolute Difference in BST](src/main/kotlin/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 209 | 86.96 +| 0230 |[Kth Smallest Element in a BST](src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 393 | 33.33 +| 0098 |[Validate Binary Search Tree](src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 190 | 61.62 -#### Day 13 Tree +#### Top Interview 150 Graph General | | | | | | |-|-|-|-|-|- -| 0700 |[Search in a Binary Search Tree](src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt)| Easy | Tree, Binary_Tree, Binary_Search_Tree | 251 | 88.31 -| 0701 |[Insert into a Binary Search Tree](src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 311 | 79.03 +| 0200 |[Number of Islands](src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 252 | 95.41 +| 0130 |[Surrounded Regions](src/main/kotlin/g0101_0200/s0130_surrounded_regions/Solution.kt)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 355 | 84.42 +| 0133 |[Clone Graph](src/main/kotlin/g0101_0200/s0133_clone_graph/Solution.kt)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 351 | 60.91 +| 0399 |[Evaluate Division](src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt)| Medium | Array, Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Shortest_Path | 183 | 91.49 +| 0207 |[Course Schedule](src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N) | 183 | 92.07 +| 0210 |[Course Schedule II](src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 266 | 96.32 -#### Day 14 Tree +#### Top Interview 150 Graph BFS | | | | | | |-|-|-|-|-|- -| 0098 |[Validate Binary Search Tree](src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 190 | 61.62 -| 0653 |[Two Sum IV - Input is a BST](src/main/kotlin/g0601_0700/s0653_two_sum_iv_input_is_a_bst/Solution.kt)| Easy | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Two_Pointers, Binary_Search_Tree | 231 | 96.08 -| 0235 |[Lowest Common Ancestor of a Binary Search Tree](src/main/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 404 | 75.59 +| 0909 |[Snakes and Ladders](src/main/kotlin/g0901_1000/s0909_snakes_and_ladders/Solution.kt)| Medium | Array, Breadth_First_Search, Matrix | 203 | 100.00 +| 0433 |[Minimum Genetic Mutation](src/main/kotlin/g0401_0500/s0433_minimum_genetic_mutation/Solution.kt)| Medium | String, Hash_Table, Breadth_First_Search | 204 | 82.08 +| 0127 |[Word Ladder](src/main/kotlin/g0101_0200/s0127_word_ladder/Solution.kt)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 396 | 98.68 -### Data Structure II +#### Top Interview 150 Trie -#### Day 1 Array +| | | | | | +|-|-|-|-|-|- +| 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00 +| 0211 |[Design Add and Search Words Data Structure](src/main/kotlin/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.kt)| Medium | String, Depth_First_Search, Design, Trie | 2256 | 87.04 +| 0212 |[Word Search II](src/main/kotlin/g0201_0300/s0212_word_search_ii/Solution.kt)| Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie | 268 | 100.00 + +#### Top Interview 150 Backtracking | | | | | | |-|-|-|-|-|- -| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 -| 0169 |[Majority Element](src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 460 | 51.25 -| 0015 |[3Sum](src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 493 | 93.45 +| 0017 |[Letter Combinations of a Phone Number](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 155 | 95.24 +| 0077 |[Combinations](src/main/kotlin/g0001_0100/s0077_combinations/Solution.kt)| Medium | Backtracking | 232 | 100.00 +| 0046 |[Permutations](src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 188 | 99.00 +| 0039 |[Combination Sum](src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 226 | 88.89 +| 0052 |[N-Queens II](src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt)| Hard | Backtracking | 128 | 97.56 +| 0022 |[Generate Parentheses](src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 161 | 85.45 +| 0079 |[Word Search](src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 392 | 72.92 -#### Day 2 Array +#### Top Interview 150 Divide and Conquer | | | | | | |-|-|-|-|-|- -| 0075 |[Sort Colors](src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 164 | 64.43 -| 0056 |[Merge Intervals](src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 334 | 80.67 -| 0706 |[Design HashMap](src/main/kotlin/g0701_0800/s0706_design_hashmap/MyHashMap.kt)| Easy | Array, Hash_Table, Design, Linked_List, Hash_Function | 405 | 92.11 +| 0108 |[Convert Sorted Array to Binary Search Tree](src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 167 | 80.29 +| 0148 |[Sort List](src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 820 | 61.70 +| 0427 |[Construct Quad Tree](src/main/kotlin/g0401_0500/s0427_construct_quad_tree/Solution.kt)| Medium | Array, Tree, Matrix, Divide_and_Conquer | 221 | 94.74 +| 0023 |[Merge k Sorted Lists](src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(k\*n\*log(k))_Space_O(log(k)) | 198 | 93.77 -#### Day 3 Array +#### Top Interview 150 Kadane's Algorithm | | | | | | |-|-|-|-|-|- -| 0119 |[Pascal's Triangle II](src/main/kotlin/g0101_0200/s0119_pascals_triangle_ii/Solution.kt)| Easy | Array, Dynamic_Programming | 157 | 97.27 -| 0048 |[Rotate Image](src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 160 | 90.11 -| 0059 |[Spiral Matrix II](src/main/kotlin/g0001_0100/s0059_spiral_matrix_ii/Solution.kt)| Medium | Array, Matrix, Simulation | 153 | 41.70 +| 0052 |[N-Queens II](src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt)| Hard | Backtracking | 128 | 97.56 +| 0918 |[Maximum Sum Circular Subarray](src/main/kotlin/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.kt)| Medium | Array, Dynamic_Programming, Divide_and_Conquer, Queue, Monotonic_Queue | 339 | 86.96 -#### Day 4 Array +#### Top Interview 150 Binary Search | | | | | | |-|-|-|-|-|- -| 0240 |[Search a 2D Matrix II](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 460 | 66.08 -| 0435 |[Non-overlapping Intervals](src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt)| Medium | Array, Dynamic_Programming, Sorting, Greedy | 1040 | 85.07 +| 0035 |[Search Insert Position](src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 159 | 93.03 +| 0074 |[Search a 2D Matrix](src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 159 | 74.46 +| 0162 |[Find Peak Element](src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt)| Medium | Top_Interview_Questions, Array, Binary_Search | 297 | 53.85 +| 0033 |[Search in Rotated Sorted Array](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 151 | 93.77 +| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 174 | 100.00 +| 0153 |[Find Minimum in Rotated Sorted Array](src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 262 | 60.96 +| 0004 |[Median of Two Sorted Arrays](src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task | 293 | 75.96 -#### Day 5 Array +#### Top Interview 150 Heap | | | | | | |-|-|-|-|-|- -| 0334 |[Increasing Triplet Subsequence](src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt)| Medium | Array, Greedy | 672 | 60.61 -| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96 -| 0560 |[Subarray Sum Equals K](src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 692 | 53.27 +| 0215 |[Kth Largest Element in an Array](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 839 | 34.43 +| 0502 |[IPO](src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt)| Hard | Array, Sorting, Greedy, Heap_Priority_Queue | 799 | 54.55 +| 0373 |[Find K Pairs with Smallest Sums](src/main/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.kt)| Medium | Array, Heap_Priority_Queue | 1809 | 80.95 +| 0295 |[Find Median from Data Stream](src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 2289 | 33.60 -#### Day 6 String +#### Top Interview 150 Bit Manipulation | | | | | | |-|-|-|-|-|- -| 0415 |[Add Strings](src/main/kotlin/g0401_0500/s0415_add_strings/Solution.kt)| Easy | String, Math, Simulation | 296 | 76.00 -| 0409 |[Longest Palindrome](src/main/kotlin/g0401_0500/s0409_longest_palindrome/Solution.kt)| Easy | String, Hash_Table, Greedy | 259 | 60.71 +| 0067 |[Add Binary](src/main/kotlin/g0001_0100/s0067_add_binary/Solution.kt)| Easy | String, Math, Bit_Manipulation, Simulation | 164 | 90.60 +| 0190 |[Reverse Bits](src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 198 | 81.82 +| 0191 |[Number of 1 Bits](src/main/kotlin/g0101_0200/s0191_number_of_1_bits/Solution.kt)| Easy | Top_Interview_Questions, Bit_Manipulation | 237 | 68.44 +| 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63 +| 0137 |[Single Number II](src/main/kotlin/g0101_0200/s0137_single_number_ii/Solution.kt)| Medium | Array, Bit_Manipulation | 344 | 64.29 +| 0201 |[Bitwise AND of Numbers Range](src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt)| Medium | Bit_Manipulation | 368 | 80.00 -#### Day 7 String +#### Top Interview 150 Math | | | | | | |-|-|-|-|-|- -| 0290 |[Word Pattern](src/main/kotlin/g0201_0300/s0290_word_pattern/Solution.kt)| Easy | String, Hash_Table | 177 | 89.55 -| 0763 |[Partition Labels](src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt)| Medium | String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 235 | 84.75 +| 0009 |[Palindrome Number](src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt)| Easy | Math | 217 | 95.34 +| 0066 |[Plus One](src/main/kotlin/g0001_0100/s0066_plus_one/Solution.kt)| Easy | Top_Interview_Questions, Array, Math | 148 | 98.75 +| 0172 |[Factorial Trailing Zeroes](src/main/kotlin/g0101_0200/s0172_factorial_trailing_zeroes/Solution.kt)| Medium | Top_Interview_Questions, Math | 220 | 67.65 +| 0069 |[Sqrt(x)](src/main/kotlin/g0001_0100/s0069_sqrtx/Solution.kt)| Easy | Top_Interview_Questions, Math, Binary_Search | 140 | 94.72 +| 0050 |[Pow(x, n)](src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt)| Medium | Top_Interview_Questions, Math, Recursion | 172 | 38.68 +| 0149 |[Max Points on a Line](src/main/kotlin/g0101_0200/s0149_max_points_on_a_line/Solution.kt)| Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry | 307 | 83.33 -#### Day 8 String +#### Top Interview 150 1D DP | | | | | | |-|-|-|-|-|- -| 0049 |[Group Anagrams](src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 308 | 96.34 -| 0043 |[Multiply Strings](src/main/kotlin/g0001_0100/s0043_multiply_strings/Solution.kt)| Medium | String, Math, Simulation | 165 | 96.72 +| 0070 |[Climbing Stairs](src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 124 | 71.98 +| 0198 |[House Robber](src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 156 | 92.24 +| 0139 |[Word Break](src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 197 | 87.17 +| 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68 +| 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28 -#### Day 9 String +#### Top Interview 150 Multidimensional DP | | | | | | |-|-|-|-|-|- -| 0187 |[Repeated DNA Sequences](src/main/kotlin/g0101_0200/s0187_repeated_dna_sequences/Solution.kt)| Medium | String, Hash_Table, Bit_Manipulation, Sliding_Window, Hash_Function, Rolling_Hash | 319 | 79.03 +| 0120 |[Triangle](src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt)| Medium | Array, Dynamic_Programming | 194 | 97.87 +| 0064 |[Minimum Path Sum](src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 164 | 100.00 +| 0063 |[Unique Paths II](src/main/kotlin/g0001_0100/s0063_unique_paths_ii/Solution.kt)| Medium | Array, Dynamic_Programming, Matrix | 151 | 81.94 | 0005 |[Longest Palindromic Substring](src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 162 | 99.00 +| 0097 |[Interleaving String](src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt)| Medium | String, Dynamic_Programming | 149 | 81.58 +| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16 +| 0123 |[Best Time to Buy and Sell Stock III](src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt)| Hard | Array, Dynamic_Programming | 585 | 95.24 +| 0188 |[Best Time to Buy and Sell Stock IV](src/main/kotlin/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.kt)| Hard | Array, Dynamic_Programming | 293 | 68.31 +| 0221 |[Maximal Square](src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 614 | 44.00 -#### Day 10 Linked List +### Data Structure I + +#### Day 1 Array | | | | | | |-|-|-|-|-|- -| 0002 |[Add Two Numbers](src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 203 | 96.13 -| 0142 |[Linked List Cycle II](src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 192 | 63.39 +| 0217 |[Contains Duplicate](src/main/kotlin/g0201_0300/s0217_contains_duplicate/Solution.kt)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49 +| 0053 |[Maximum Subarray](src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81 -#### Day 11 Linked List +#### Day 2 Array | | | | | | |-|-|-|-|-|- -| 0160 |[Intersection of Two Linked Lists](src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 262 | 83.50 -| 0082 |[Remove Duplicates from Sorted List II](src/main/kotlin/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.kt)| Medium | Two_Pointers, Linked_List | 166 | 89.47 +| 0001 |[Two Sum](src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 202 | 91.18 +| 0088 |[Merge Sorted Array](src/main/kotlin/g0001_0100/s0088_merge_sorted_array/Solution.kt)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 170 | 69.74 -#### Day 12 Linked List +#### Day 3 Array | | | | | | |-|-|-|-|-|- -| 0024 |[Swap Nodes in Pairs](src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 149 | 44.20 -| 0707 |[Design Linked List](src/main/kotlin/g0701_0800/s0707_design_linked_list/MyLinkedList.kt)| Medium | Design, Linked_List | 243 | 100.00 +| 0350 |[Intersection of Two Arrays II](src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 321 | 73.37 +| 0121 |[Best Time to Buy and Sell Stock](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 609 | 94.06 -#### Day 13 Linked List +#### Day 4 Array | | | | | | |-|-|-|-|-|- -| 0025 |[Reverse Nodes in k-Group](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 189 | 67.03 -| 0143 |[Reorder List](src/main/kotlin/g0101_0200/s0143_reorder_list/Solution.kt)| Medium | Two_Pointers, Stack, Linked_List, Recursion | 395 | 82.26 +| 0566 |[Reshape the Matrix](src/main/kotlin/g0501_0600/s0566_reshape_the_matrix/Solution.kt)| Easy | Array, Matrix, Simulation | 239 | 99.05 +| 0118 |[Pascal's Triangle](src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22 -#### Day 14 Stack Queue +#### Day 5 Array | | | | | | |-|-|-|-|-|- -| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88 -| 1249 |[Minimum Remove to Make Valid Parentheses](src/main/kotlin/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses/Solution.kt)| Medium | String, Stack | 218 | 100.00 -| 1823 |[Find the Winner of the Circular Game](src/main/kotlin/g1801_1900/s1823_find_the_winner_of_the_circular_game/Solution.kt)| Medium | Array, Math, Simulation, Recursion, Queue | 119 | 87.50 +| 0036 |[Valid Sudoku](src/main/kotlin/g0001_0100/s0036_valid_sudoku/Solution.kt)| Medium | Top_Interview_Questions, Array, Hash_Table, Matrix | 181 | 95.15 +| 0074 |[Search a 2D Matrix](src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 159 | 74.46 -#### Day 15 Tree +#### Day 6 String | | | | | | |-|-|-|-|-|- -| 0108 |[Convert Sorted Array to Binary Search Tree](src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt)| Easy | Top_Interview_Questions, Array, Tree, Binary_Tree, Binary_Search_Tree, Divide_and_Conquer | 167 | 80.29 -| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 183 | 95.45 -| 0103 |[Binary Tree Zigzag Level Order Traversal](src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 176 | 71.62 +| 0387 |[First Unique Character in a String](src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt)| Easy | String, Hash_Table, Counting, Queue | 369 | 82.68 +| 0383 |[Ransom Note](src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt)| Easy | String, Hash_Table, Counting | 333 | 79.58 +| 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | String, Hash_Table, Sorting | 251 | 87.65 -#### Day 16 Tree +#### Day 7 Linked List | | | | | | |-|-|-|-|-|- -| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89 -| 0113 |[Path Sum II](src/main/kotlin/g0101_0200/s0113_path_sum_ii/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, Backtracking | 364 | 78.67 -| 0450 |[Delete Node in a BST](src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 257 | 84.62 +| 0141 |[Linked List Cycle](src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 223 | 91.85 +| 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24 +| 0203 |[Remove Linked List Elements](src/main/kotlin/g0201_0300/s0203_remove_linked_list_elements/Solution.kt)| Easy | Linked_List, Recursion | 233 | 91.22 -#### Day 17 Tree +#### Day 8 Linked List | | | | | | |-|-|-|-|-|- -| 0230 |[Kth Smallest Element in a BST](src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 393 | 33.33 -| 0173 |[Binary Search Tree Iterator](src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt)| Medium | Tree, Binary_Tree, Stack, Design, Binary_Search_Tree, Iterator | 563 | 46.91 +| 0206 |[Reverse Linked List](src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 279 | 45.78 +| 0083 |[Remove Duplicates from Sorted List](src/main/kotlin/g0001_0100/s0083_remove_duplicates_from_sorted_list/Solution.kt)| Easy | Linked_List | 173 | 82.42 -#### Day 18 Tree +#### Day 9 Stack Queue | | | | | | |-|-|-|-|-|- -| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21 -| 0297 |[Serialize and Deserialize Binary Tree](src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt)| Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85 +| 0020 |[Valid Parentheses](src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 137 | 88.76 +| 0232 |[Implement Queue using Stacks](src/main/kotlin/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.kt)| Easy | Stack, Design, Queue | 258 | 70.86 -#### Day 19 Graph +#### Day 10 Tree | | | | | | |-|-|-|-|-|- -| 0997 |[Find the Town Judge](src/main/kotlin/g0901_1000/s0997_find_the_town_judge/Solution.kt)| Easy | Array, Hash_Table, Graph | 475 | 58.62 -| 1557 |[Minimum Number of Vertices to Reach All Nodes](src/main/kotlin/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.kt)| Medium | Graph | 792 | 99.29 -| 0841 |[Keys and Rooms](src/main/kotlin/g0801_0900/s0841_keys_and_rooms/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 189 | 69.23 +| 0144 |[Binary Tree Preorder Traversal](src/main/kotlin/g0101_0200/s0144_binary_tree_preorder_traversal/Solution.kt)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 277 | 37.90 +| 0094 |[Binary Tree Inorder Traversal](src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 152 | 66.67 +| 0145 |[Binary Tree Postorder Traversal](src/main/kotlin/g0101_0200/s0145_binary_tree_postorder_traversal/Solution.kt)| Easy | Depth_First_Search, Tree, Binary_Tree, Stack | 211 | 80.00 -#### Day 20 Heap Priority Queue +#### Day 11 Tree | | | | | | |-|-|-|-|-|- -| 0215 |[Kth Largest Element in an Array](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 839 | 34.43 -| 0347 |[Top K Frequent Elements](src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n\*log(n))_Space_O(k) | 268 | 99.74 +| 0102 |[Binary Tree Level Order Traversal](src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 198 | 95.14 +| 0104 |[Maximum Depth of Binary Tree](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 166 | 83.53 +| 0101 |[Symmetric Tree](src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35 -#### Day 21 Heap Priority Queue +#### Day 12 Tree | | | | | | |-|-|-|-|-|- -| 0451 |[Sort Characters By Frequency](src/main/kotlin/g0401_0500/s0451_sort_characters_by_frequency/Solution.kt)| Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Bucket_Sort | 288 | 81.72 -| 0973 |[K Closest Points to Origin](src/main/kotlin/g0901_1000/s0973_k_closest_points_to_origin/Solution.kt)| Medium | Array, Math, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Geometry, Quickselect | 800 | 37.89 +| 0226 |[Invert Binary Tree](src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 233 | 54.90 +| 0112 |[Path Sum](src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 322 | 36.41 + +#### Day 13 Tree + +| | | | | | +|-|-|-|-|-|- +| 0700 |[Search in a Binary Search Tree](src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt)| Easy | Tree, Binary_Tree, Binary_Search_Tree | 251 | 88.31 +| 0701 |[Insert into a Binary Search Tree](src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 311 | 79.03 + +#### Day 14 Tree + +| | | | | | +|-|-|-|-|-|- +| 0098 |[Validate Binary Search Tree](src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 190 | 61.62 +| 0653 |[Two Sum IV - Input is a BST](src/main/kotlin/g0601_0700/s0653_two_sum_iv_input_is_a_bst/Solution.kt)| Easy | Hash_Table, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Two_Pointers, Binary_Search_Tree | 231 | 96.08 +| 0235 |[Lowest Common Ancestor of a Binary Search Tree](src/main/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 404 | 75.59 ## Contributing Your ideas/fixes/algorithms are more than welcome! diff --git a/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt index 2e4acfcf8..bd87acd71 100644 --- a/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt @@ -1,8 +1,9 @@ package g0001_0100.s0001_two_sum // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) -// #AI_can_be_used_to_solve_the_task #2023_07_03_Time_202_ms_(91.18%)_Space_38.1_MB_(76.07%) +// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task +// #2023_07_03_Time_202_ms_(91.18%)_Space_38.1_MB_(76.07%) class Solution { fun twoSum(numbers: IntArray, target: Int): IntArray { diff --git a/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt b/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt index 27d608e69..ad1ca0c51 100644 --- a/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt @@ -2,8 +2,8 @@ package g0001_0100.s0002_add_two_numbers // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #AI_can_be_used_to_solve_the_task -// #2023_07_03_Time_203_ms_(96.13%)_Space_41_MB_(77.03%) +// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +// #AI_can_be_used_to_solve_the_task #2023_07_03_Time_203_ms_(96.13%)_Space_41_MB_(77.03%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt b/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt index 2c0bea8ea..e84071a46 100644 --- a/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0003_longest_substring_without_repeating_characters // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window // #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task // #2023_07_03_Time_201_ms_(87.28%)_Space_38.3_MB_(60.85%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt b/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt index 4ce718645..06d87954e 100644 --- a/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0004_median_of_two_sorted_arrays // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #AI_can_be_used_to_solve_the_task -// #2023_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%) +// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +// #AI_can_be_used_to_solve_the_task #2023_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%) class Solution { fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double { diff --git a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt index 40fee3c2b..76a5fc17b 100644 --- a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt @@ -2,8 +2,8 @@ package g0001_0100.s0005_longest_palindromic_substring // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2023_07_03_Time_162_ms_(99.00%)_Space_36.6_MB_(79.10%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2023_07_03_Time_162_ms_(99.00%)_Space_36.6_MB_(79.10%) class Solution { fun longestPalindrome(s: String): String { diff --git a/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt b/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt index add86d34c..3e080d105 100644 --- a/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0006_zigzag_conversion -// #Medium #String #2023_07_03_Time_200_ms_(97.79%)_Space_37.3_MB_(91.71%) +// #Medium #String #Top_Interview_150_Array/String +// #2023_07_03_Time_200_ms_(97.79%)_Space_37.3_MB_(91.71%) class Solution { fun convert(s: String, numRows: Int): String { diff --git a/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt b/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt index 7fffc5c66..ed6f39feb 100644 --- a/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0009_palindrome_number -// #Easy #Math #Udemy_Integers #2023_07_03_Time_217_ms_(95.34%)_Space_36.1_MB_(98.21%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2023_07_03_Time_217_ms_(95.34%)_Space_36.1_MB_(98.21%) class Solution { fun isPalindrome(x: Int): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt index f0e43d403..d3b39ab8c 100644 --- a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0011_container_with_most_water // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) +// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1) // #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt b/src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt index 17e6114cb..3cc002a26 100644 --- a/src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0012_integer_to_roman/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0012_integer_to_roman -// #Medium #String #Hash_Table #Math #2023_07_03_Time_180_ms_(98.25%)_Space_37_MB_(82.89%) +// #Medium #String #Hash_Table #Math #Top_Interview_150_Array/String +// #2023_07_03_Time_180_ms_(98.25%)_Space_37_MB_(82.89%) class Solution { fun intToRoman(num: Int): String { diff --git a/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt b/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt index a7bbd60b4..219674349 100644 --- a/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0013_roman_to_integer // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math -// #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%) +// #Top_Interview_150_Array/String #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%) class Solution { fun romanToInt(s: String): Int { diff --git a/src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt b/src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt index e974276f3..cd9e6866d 100644 --- a/src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt @@ -1,7 +1,8 @@ package g0001_0100.s0014_longest_common_prefix // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String -// #Udemy_Strings #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%) +// #Udemy_Strings #Top_Interview_150_Array/String +// #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%) class Solution { fun longestCommonPrefix(strs: Array): String { diff --git a/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt b/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt index 0636a7005..5c512be6e 100644 --- a/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0015_3sum // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_07_03_Time_493_ms_(93.45%)_Space_53_MB_(93.97%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2023_07_03_Time_493_ms_(93.45%)_Space_53_MB_(93.97%) class Solution { fun threeSum(nums: IntArray): List> { diff --git a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt index b9532e2bf..fecc2bd9f 100644 --- a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0017_letter_combinations_of_a_phone_number // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking // #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(4^n)_Space_O(n) #2023_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #2023_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%) class Solution { fun letterCombinations(digits: String): List { diff --git a/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt b/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt index 704c5e4ee..3fd5e91c4 100644 --- a/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0019_remove_nth_node_from_end_of_list // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -// #2023_07_03_Time_144_ms_(96.28%)_Space_34.5_MB_(76.50%) +// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(L)_Space_O(L) #2023_07_03_Time_144_ms_(96.28%)_Space_34.5_MB_(76.50%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt b/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt index 27463b118..9f18f40bf 100644 --- a/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0020_valid_parentheses // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2023_07_03_Time_137_ms_(88.76%)_Space_33.7_MB_(90.45%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2023_07_03_Time_137_ms_(88.76%)_Space_33.7_MB_(90.45%) class Solution { fun isValid(s: String): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt b/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt index 5b3fbacaa..fabd6adb2 100644 --- a/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt @@ -2,8 +2,8 @@ package g0001_0100.s0021_merge_two_sorted_lists // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -// #2023_07_03_Time_157_ms_(92.24%)_Space_35.7_MB_(68.58%) +// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(m+n)_Space_O(m+n) #2023_07_03_Time_157_ms_(92.24%)_Space_35.7_MB_(68.58%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt b/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt index 3938522af..4fd66a6c4 100644 --- a/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0022_generate_parentheses // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n) #2023_07_03_Time_161_ms_(85.45%)_Space_37.3_MB_(66.18%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2023_07_03_Time_161_ms_(85.45%)_Space_37.3_MB_(66.18%) class Solution { fun generateParenthesis(n: Int): List { diff --git a/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt b/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt index 933185af3..8a4f5af0f 100644 --- a/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt @@ -1,7 +1,8 @@ package g0001_0100.s0023_merge_k_sorted_lists // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) // #2023_07_03_Time_198_ms_(93.77%)_Space_37.6_MB_(97.03%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt b/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt index 705aba490..ffa64b8e5 100644 --- a/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0025_reverse_nodes_in_k_group // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) // #2023_07_03_Time_189_ms_(67.03%)_Space_36.7_MB_(71.43%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.kt b/src/main/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.kt index d31c2e374..d3bd0a346 100644 --- a/src/main/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0026_remove_duplicates_from_sorted_array // #Easy #Top_Interview_Questions #Array #Two_Pointers #Udemy_Two_Pointers -// #2023_07_03_Time_249_ms_(67.38%)_Space_42_MB_(57.99%) +// #Top_Interview_150_Array/String #2023_07_03_Time_249_ms_(67.38%)_Space_42_MB_(57.99%) class Solution { fun removeDuplicates(nums: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0027_remove_element/Solution.kt b/src/main/kotlin/g0001_0100/s0027_remove_element/Solution.kt index c8e6a37d8..e0e574f15 100644 --- a/src/main/kotlin/g0001_0100/s0027_remove_element/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0027_remove_element/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0027_remove_element -// #Easy #Array #Two_Pointers #2023_07_03_Time_162_ms_(76.44%)_Space_34.8_MB_(70.69%) +// #Easy #Array #Two_Pointers #Top_Interview_150_Array/String +// #2023_07_03_Time_162_ms_(76.44%)_Space_34.8_MB_(70.69%) class Solution { fun removeElement(nums: IntArray, `val`: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.kt b/src/main/kotlin/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.kt index 79f9d6ccd..24b77726f 100644 --- a/src/main/kotlin/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.kt @@ -1,7 +1,8 @@ package g0001_0100.s0028_find_the_index_of_the_first_occurrence_in_a_string // #Easy #Top_Interview_Questions #String #Two_Pointers #String_Matching -// #Programming_Skills_II_Day_1 #2023_07_03_Time_126_ms_(97.58%)_Space_34.2_MB_(76.09%) +// #Programming_Skills_II_Day_1 #Top_Interview_150_Array/String +// #2023_07_03_Time_126_ms_(97.58%)_Space_34.2_MB_(76.09%) class Solution { fun strStr(haystack: String, needle: String): Int { diff --git a/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt b/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt index 28549689d..f0f60f39c 100644 --- a/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0030_substring_with_concatenation_of_all_words -// #Hard #String #Hash_Table #Sliding_Window +// #Hard #String #Hash_Table #Sliding_Window #Top_Interview_150_Sliding_Window // #2023_07_03_Time_182_ms_(100.00%)_Space_37.9_MB_(100.00%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt b/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt index 3b3e68a34..af4bc0dc5 100644 --- a/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0033_search_in_rotated_sorted_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2023_07_05_Time_151_ms_(93.77%)_Space_34.5_MB_(94.08%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt b/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt index 802b96682..d8bf82b3f 100644 --- a/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -// #2023_07_05_Time_174_ms_(100.00%)_Space_37.8_MB_(71.70%) +// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_n)_Space_O(1) #2023_07_05_Time_174_ms_(100.00%)_Space_37.8_MB_(71.70%) class Solution constructor() { fun searchRange(nums: IntArray, target: Int): IntArray { diff --git a/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt b/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt index 933c28276..f12fd25ca 100644 --- a/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0035_search_insert_position // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2023_07_05_Time_159_ms_(93.03%)_Space_36.7_MB_(95.90%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0036_valid_sudoku/Solution.kt b/src/main/kotlin/g0001_0100/s0036_valid_sudoku/Solution.kt index 7fc0985eb..58586328a 100644 --- a/src/main/kotlin/g0001_0100/s0036_valid_sudoku/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0036_valid_sudoku/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0036_valid_sudoku // #Medium #Top_Interview_Questions #Array #Hash_Table #Matrix #Data_Structure_I_Day_5_Array -// #2023_07_05_Time_181_ms_(95.15%)_Space_40_MB_(62.78%) +// #Top_Interview_150_Matrix #2023_07_05_Time_181_ms_(95.15%)_Space_40_MB_(62.78%) class Solution { private var j1 = 0 diff --git a/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt index 473d0524e..5b965710e 100644 --- a/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0039_combination_sum // #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking // #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_07_05_Time_226_ms_(88.89%)_Space_38.1_MB_(94.95%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2023_07_05_Time_226_ms_(88.89%)_Space_38.1_MB_(94.95%) class Solution { fun combinationSum(candidates: IntArray, target: Int): List> { diff --git a/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt b/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt index 4638df9fe..b0ef88fbf 100644 --- a/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0042_trapping_rain_water // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers // #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers -// #Big_O_Time_O(n)_Space_O(1) #2023_07_05_Time_189_ms_(99.37%)_Space_39.4_MB_(81.90%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_07_05_Time_189_ms_(99.37%)_Space_39.4_MB_(81.90%) class Solution { fun trap(height: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt index d43848e32..4433fd06f 100644 --- a/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0045_jump_game_ii // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy // #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4 -// #Big_O_Time_O(n)_Space_O(1) #2023_07_05_Time_208_ms_(93.37%)_Space_38.2_MB_(94.48%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_07_05_Time_208_ms_(93.37%)_Space_38.2_MB_(94.48%) class Solution { fun jump(nums: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt b/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt index 129b871ce..cc5ec1780 100644 --- a/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0046_permutations // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking // #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking -// #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) // #2023_07_05_Time_188_ms_(99.00%)_Space_37.4_MB_(88.94%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt b/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt index e54b21e6b..f1187f18e 100644 --- a/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0048_rotate_image // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix // #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix -// #Big_O_Time_O(n^2)_Space_O(1) #2023_07_05_Time_160_ms_(90.11%)_Space_35_MB_(84.07%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2023_07_05_Time_160_ms_(90.11%)_Space_35_MB_(84.07%) class Solution { fun rotate(matrix: Array) { diff --git a/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt b/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt index f03be4e89..32d69d57a 100644 --- a/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0049_group_anagrams // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting // #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings -// #Big_O_Time_O(n*k_log_k)_Space_O(n) #2023_07_05_Time_308_ms_(96.34%)_Space_43.3_MB_(81.41%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2023_07_05_Time_308_ms_(96.34%)_Space_43.3_MB_(81.41%) class Solution { fun groupAnagrams(strs: Array): List> { diff --git a/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt b/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt index 75121bcfd..3429435d7 100644 --- a/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0050_powx_n/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0050_powx_n -// #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers #Top_Interview_150_Math // #2023_07_05_Time_172_ms_(38.68%)_Space_34.8_MB_(66.04%) @Suppress("NAME_SHADOWING") diff --git a/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt index 9ce21317d..c3faa7c0e 100644 --- a/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0052_n_queens_ii -// #Hard #Backtracking #2023_07_10_Time_128_ms_(97.56%)_Space_32.7_MB_(92.68%) +// #Hard #Backtracking #Top_Interview_150_Backtracking #Top_Interview_150_Kadane's_Algorithm +// #2023_07_10_Time_128_ms_(97.56%)_Space_32.7_MB_(92.68%) class Solution { fun totalNQueens(n: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt b/src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt index dbb3e7dde..fbcc051a9 100644 --- a/src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0054_spiral_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_07_10_Time_132_ms_(95.12%)_Space_33.5_MB_(93.17%) +// #Top_Interview_150_Matrix #2023_07_10_Time_132_ms_(95.12%)_Space_33.5_MB_(93.17%) class Solution { fun spiralOrder(matrix: Array): List { diff --git a/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt b/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt index 07358d45b..a8d4981fa 100644 --- a/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0055_jump_game // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy // #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays -// #Big_O_Time_O(n)_Space_O(1) #2023_07_10_Time_332_ms_(89.35%)_Space_39_MB_(96.44%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_07_10_Time_332_ms_(89.35%)_Space_39_MB_(96.44%) class Solution { fun canJump(nums: IntArray): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt b/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt index 5fffab202..ccc311017 100644 --- a/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt @@ -2,7 +2,8 @@ package g0001_0100.s0056_merge_intervals // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting // #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix -// #Big_O_Time_O(n_log_n)_Space_O(n) #2023_07_10_Time_334_ms_(80.67%)_Space_43.7_MB_(78.81%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2023_07_10_Time_334_ms_(80.67%)_Space_43.7_MB_(78.81%) class Solution { fun merge(intervals: Array): Array { diff --git a/src/main/kotlin/g0001_0100/s0057_insert_interval/Solution.kt b/src/main/kotlin/g0001_0100/s0057_insert_interval/Solution.kt index d6e6c8a37..6635f97ad 100644 --- a/src/main/kotlin/g0001_0100/s0057_insert_interval/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0057_insert_interval/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0057_insert_interval -// #Medium #Array #Level_2_Day_17_Interval #2023_07_10_Time_249_ms_(75.63%)_Space_40.4_MB_(60.87%) +// #Medium #Array #Level_2_Day_17_Interval #Top_Interview_150_Intervals +// #2023_07_10_Time_249_ms_(75.63%)_Space_40.4_MB_(60.87%) class Solution { fun insert(intervals: Array, newInterval: IntArray): Array { diff --git a/src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt b/src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt index 857298f5e..8718b418a 100644 --- a/src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0058_length_of_last_word -// #Easy #String #Programming_Skills_II_Day_6 #Udemy_Arrays +// #Easy #String #Programming_Skills_II_Day_6 #Udemy_Arrays #Top_Interview_150_Array/String // #2023_07_10_Time_135_ms_(93.67%)_Space_34.3_MB_(94.69%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0061_rotate_list/Solution.kt b/src/main/kotlin/g0001_0100/s0061_rotate_list/Solution.kt index ed59196c1..ddd1f97f1 100644 --- a/src/main/kotlin/g0001_0100/s0061_rotate_list/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0061_rotate_list/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0061_rotate_list // #Medium #Two_Pointers #Linked_List #Programming_Skills_II_Day_16 #Udemy_Linked_List -// #2023_07_10_Time_160_ms_(92.22%)_Space_36.2_MB_(63.33%) +// #Top_Interview_150_Linked_List #2023_07_10_Time_160_ms_(92.22%)_Space_36.2_MB_(63.33%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0063_unique_paths_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0063_unique_paths_ii/Solution.kt index 963a1aada..dace610be 100644 --- a/src/main/kotlin/g0001_0100/s0063_unique_paths_ii/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0063_unique_paths_ii/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0063_unique_paths_ii // #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_15 -// #2023_07_10_Time_151_ms_(81.94%)_Space_34.3_MB_(94.44%) +// #Top_Interview_150_Multidimensional_DP #2023_07_10_Time_151_ms_(81.94%)_Space_34.3_MB_(94.44%) class Solution { fun uniquePathsWithObstacles(obstacleGrid: Array): Int { diff --git a/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt index afd340963..f04282731 100644 --- a/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0064_minimum_path_sum // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix -// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n) -// #2023_07_10_Time_164_ms_(100.00%)_Space_37.3_MB_(84.71%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_07_10_Time_164_ms_(100.00%)_Space_37.3_MB_(84.71%) class Solution { fun minPathSum(grid: Array): Int { diff --git a/src/main/kotlin/g0001_0100/s0066_plus_one/Solution.kt b/src/main/kotlin/g0001_0100/s0066_plus_one/Solution.kt index ec6a4ef2b..07c4a8873 100644 --- a/src/main/kotlin/g0001_0100/s0066_plus_one/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0066_plus_one/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0066_plus_one // #Easy #Top_Interview_Questions #Array #Math #Programming_Skills_II_Day_3 #Udemy_Arrays -// #2023_07_10_Time_148_ms_(98.75%)_Space_34.6_MB_(81.44%) +// #Top_Interview_150_Math #2023_07_10_Time_148_ms_(98.75%)_Space_34.6_MB_(81.44%) class Solution { fun plusOne(digits: IntArray): IntArray { diff --git a/src/main/kotlin/g0001_0100/s0067_add_binary/Solution.kt b/src/main/kotlin/g0001_0100/s0067_add_binary/Solution.kt index 72154b839..95ef64af2 100644 --- a/src/main/kotlin/g0001_0100/s0067_add_binary/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0067_add_binary/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0067_add_binary // #Easy #String #Math #Bit_Manipulation #Simulation #Programming_Skills_II_Day_5 -// #2023_07_10_Time_164_ms_(90.60%)_Space_34.4_MB_(99.25%) +// #Top_Interview_150_Bit_Manipulation #2023_07_10_Time_164_ms_(90.60%)_Space_34.4_MB_(99.25%) class Solution { fun addBinary(a: String, b: String): String { diff --git a/src/main/kotlin/g0001_0100/s0068_text_justification/Solution.kt b/src/main/kotlin/g0001_0100/s0068_text_justification/Solution.kt index df4513c56..51dd2afad 100644 --- a/src/main/kotlin/g0001_0100/s0068_text_justification/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0068_text_justification/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0068_text_justification -// #Hard #Array #String #Simulation #2023_07_10_Time_153_ms_(92.96%)_Space_34.1_MB_(100.00%) +// #Hard #Array #String #Simulation #Top_Interview_150_Array/String +// #2023_07_10_Time_153_ms_(92.96%)_Space_34.1_MB_(100.00%) class Solution { fun fullJustify(words: Array, maxWidth: Int): List { diff --git a/src/main/kotlin/g0001_0100/s0069_sqrtx/Solution.kt b/src/main/kotlin/g0001_0100/s0069_sqrtx/Solution.kt index 08c53d867..373db1e3b 100644 --- a/src/main/kotlin/g0001_0100/s0069_sqrtx/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0069_sqrtx/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0069_sqrtx // #Easy #Top_Interview_Questions #Math #Binary_Search #Binary_Search_I_Day_4 -// #2023_07_10_Time_140_ms_(94.72%)_Space_33.5_MB_(66.67%) +// #Top_Interview_150_Math #2023_07_10_Time_140_ms_(94.72%)_Space_33.5_MB_(66.67%) class Solution { fun mySqrt(x: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt b/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt index d59b39f5a..310fcdbfc 100644 --- a/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt @@ -2,8 +2,8 @@ package g0001_0100.s0070_climbing_stairs // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization // #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2 -// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2023_07_10_Time_124_ms_(71.98%)_Space_33.2_MB_(48.60%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2023_07_10_Time_124_ms_(71.98%)_Space_33.2_MB_(48.60%) class Solution { fun climbStairs(n: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0071_simplify_path/Solution.kt b/src/main/kotlin/g0001_0100/s0071_simplify_path/Solution.kt index 5b9a52180..93a6c1b11 100644 --- a/src/main/kotlin/g0001_0100/s0071_simplify_path/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0071_simplify_path/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0071_simplify_path -// #Medium #String #Stack #2023_07_10_Time_185_ms_(92.86%)_Space_36.3_MB_(100.00%) +// #Medium #String #Stack #Top_Interview_150_Stack +// #2023_07_10_Time_185_ms_(92.86%)_Space_36.3_MB_(100.00%) import java.util.ArrayDeque import java.util.Deque diff --git a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt index 7d842d877..89da79540 100644 --- a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0072_edit_distance // #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) +// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt b/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt index b1555da5e..21f421c87 100644 --- a/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0073_set_matrix_zeroes // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) // #2023_07_10_Time_248_ms_(97.33%)_Space_41.6_MB_(79.87%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt b/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt index b1a79d8a2..85dda955c 100644 --- a/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0074_search_a_2d_matrix // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) // #2023_07_10_Time_159_ms_(74.46%)_Space_35.1_MB_(74.89%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt b/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt index 161059947..05f6e3c96 100644 --- a/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0076_minimum_window_substring // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -// #2023_07_10_Time_191_ms_(96.38%)_Space_37.2_MB_(93.33%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2023_07_10_Time_191_ms_(96.38%)_Space_37.2_MB_(93.33%) class Solution { fun minWindow(s: String, t: String): String { diff --git a/src/main/kotlin/g0001_0100/s0077_combinations/Solution.kt b/src/main/kotlin/g0001_0100/s0077_combinations/Solution.kt index 582ab75f4..690ec7764 100644 --- a/src/main/kotlin/g0001_0100/s0077_combinations/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0077_combinations/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0077_combinations -// #Medium #Backtracking #Algorithm_I_Day_11_Recursion_Backtracking +// #Medium #Backtracking #Algorithm_I_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking // #2023_07_10_Time_232_ms_(100.00%)_Space_41.1_MB_(95.65%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt b/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt index 3bed9ef04..3e65c1961 100644 --- a/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0079_word_search // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -// #2023_07_10_Time_392_ms_(72.92%)_Space_34.7_MB_(83.33%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2023_07_10_Time_392_ms_(72.92%)_Space_34.7_MB_(83.33%) class Solution { private fun backtrace( diff --git a/src/main/kotlin/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.kt index 2cf8b9694..72f3ce63f 100644 --- a/src/main/kotlin/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0080_remove_duplicates_from_sorted_array_ii -// #Medium #Array #Two_Pointers #Udemy_Arrays +// #Medium #Array #Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String // #2023_07_10_Time_192_ms_(80.67%)_Space_37.2_MB_(62.67%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.kt index 716e34ca4..b09549669 100644 --- a/src/main/kotlin/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii/Solution.kt @@ -1,7 +1,8 @@ package g0001_0100.s0082_remove_duplicates_from_sorted_list_ii // #Medium #Two_Pointers #Linked_List #Data_Structure_II_Day_11_Linked_List -// #Algorithm_II_Day_3_Two_Pointers #2023_07_10_Time_166_ms_(89.47%)_Space_36.8_MB_(63.16%) +// #Algorithm_II_Day_3_Two_Pointers #Top_Interview_150_Linked_List +// #2023_07_10_Time_166_ms_(89.47%)_Space_36.8_MB_(63.16%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0086_partition_list/Solution.kt b/src/main/kotlin/g0001_0100/s0086_partition_list/Solution.kt index 728718b5b..81147818d 100644 --- a/src/main/kotlin/g0001_0100/s0086_partition_list/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0086_partition_list/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0086_partition_list -// #Medium #Two_Pointers #Linked_List #2023_07_10_Time_160_ms_(70.73%)_Space_35.1_MB_(46.34%) +// #Medium #Two_Pointers #Linked_List #Top_Interview_150_Linked_List +// #2023_07_10_Time_160_ms_(70.73%)_Space_35.1_MB_(46.34%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0088_merge_sorted_array/Solution.kt b/src/main/kotlin/g0001_0100/s0088_merge_sorted_array/Solution.kt index 68820c221..6d928639f 100644 --- a/src/main/kotlin/g0001_0100/s0088_merge_sorted_array/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0088_merge_sorted_array/Solution.kt @@ -1,7 +1,7 @@ package g0001_0100.s0088_merge_sorted_array // #Easy #Top_Interview_Questions #Array #Sorting #Two_Pointers #Data_Structure_I_Day_2_Array -// #2023_07_10_Time_170_ms_(69.74%)_Space_34.5_MB_(99.18%) +// #Top_Interview_150_Array/String #2023_07_10_Time_170_ms_(69.74%)_Space_34.5_MB_(99.18%) class Solution { fun merge(nums1: IntArray, m: Int, nums2: IntArray, n: Int) { diff --git a/src/main/kotlin/g0001_0100/s0092_reverse_linked_list_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0092_reverse_linked_list_ii/Solution.kt index 5bb40b637..e89522198 100644 --- a/src/main/kotlin/g0001_0100/s0092_reverse_linked_list_ii/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0092_reverse_linked_list_ii/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0092_reverse_linked_list_ii -// #Medium #Linked_List #2023_07_10_Time_144_ms_(75.00%)_Space_33.8_MB_(72.06%) +// #Medium #Linked_List #Top_Interview_150_Linked_List +// #2023_07_10_Time_144_ms_(75.00%)_Space_33.8_MB_(72.06%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt b/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt index 43bc40285..52e49a8d4 100644 --- a/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0097_interleaving_string/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0097_interleaving_string -// #Medium #String #Dynamic_Programming #2023_07_10_Time_149_ms_(81.58%)_Space_33.8_MB_(97.37%) +// #Medium #String #Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #2023_07_10_Time_149_ms_(81.58%)_Space_33.8_MB_(97.37%) class Solution { fun isInterleave(s1: String, s2: String, s3: String): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt b/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt index 2032bd889..ad18a6182 100644 --- a/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0098_validate_binary_search_tree // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree -// #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N)) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) // #2023_07_10_Time_190_ms_(61.62%)_Space_37.6_MB_(48.48%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt b/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt index 17c0a1060..2f9acf4ee 100644 --- a/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt @@ -1,7 +1,8 @@ package g0001_0100.s0100_same_tree // #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Level_2_Day_15_Tree -// #Udemy_Tree_Stack_Queue #2023_07_10_Time_134_ms_(86.63%)_Space_33.8_MB_(48.19%) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #2023_07_10_Time_134_ms_(86.63%)_Space_33.8_MB_(48.19%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt index f5bacc07c..6614e8381 100644 --- a/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt @@ -2,7 +2,8 @@ package g0101_0200.s0101_symmetric_tree // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -// #Big_O_Time_O(N)_Space_O(log(N)) #2023_07_11_Time_153_ms_(82.35%)_Space_34.2_MB_(88.24%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2023_07_11_Time_153_ms_(82.35%)_Space_34.2_MB_(88.24%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt index 719c71d15..4d9901ace 100644 --- a/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt @@ -2,7 +2,8 @@ package g0101_0200.s0102_binary_tree_level_order_traversal // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree // #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(N) #2023_07_11_Time_198_ms_(95.14%)_Space_37_MB_(88.26%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2023_07_11_Time_198_ms_(95.14%)_Space_37_MB_(88.26%) import com_github_leetcode.TreeNode import java.util.ArrayList diff --git a/src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt index d6219ed0a..af8004c2a 100644 --- a/src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0103_binary_tree_zigzag_level_order_traversal // #Medium #Top_Interview_Questions #Breadth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_15_Tree #Udemy_Tree_Stack_Queue +// #Data_Structure_II_Day_15_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_BFS // #2023_07_11_Time_176_ms_(71.62%)_Space_34.9_MB_(87.84%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt index 6c7ae5a20..60bd48b25 100644 --- a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt @@ -3,7 +3,8 @@ package g0101_0200.s0104_maximum_depth_of_binary_tree // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(H) #2023_07_11_Time_166_ms_(83.53%)_Space_36.5_MB_(86.11%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2023_07_11_Time_166_ms_(83.53%)_Space_36.5_MB_(86.11%) import com_github_leetcode.TreeNode import kotlin.math.max diff --git a/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt index 9948f12c1..b4a3ec000 100644 --- a/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -// #2023_07_11_Time_183_ms_(95.45%)_Space_36.9_MB_(82.73%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2023_07_11_Time_183_ms_(95.45%)_Space_36.9_MB_(82.73%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.kt index 3a82ae940..9294ffce5 100644 --- a/src/main/kotlin/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal // #Medium #Array #Hash_Table #Tree #Binary_Tree #Divide_and_Conquer -// #2023_07_11_Time_167_ms_(100.00%)_Space_36.9_MB_(88.46%) +// #Top_Interview_150_Binary_Tree_General #2023_07_11_Time_167_ms_(100.00%)_Space_36.9_MB_(88.46%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt index 3b749b295..3c0860052 100644 --- a/src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0108_convert_sorted_array_to_binary_search_tree // #Easy #Top_Interview_Questions #Array #Tree #Binary_Tree #Binary_Search_Tree #Divide_and_Conquer // #Data_Structure_II_Day_15_Tree #Level_2_Day_9_Binary_Search_Tree #Udemy_Tree_Stack_Queue -// #2023_07_11_Time_167_ms_(80.29%)_Space_36.6_MB_(83.94%) +// #Top_Interview_150_Divide_and_Conquer #2023_07_11_Time_167_ms_(80.29%)_Space_36.6_MB_(83.94%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt b/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt index fdcf5a9f2..5e79cc5b5 100644 --- a/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0112_path_sum/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0112_path_sum // #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Data_Structure_I_Day_12_Tree -// #2022_09_29_Time_322_ms_(36.41%)_Space_39.6_MB_(18.97%) +// #Top_Interview_150_Binary_Tree_General #2022_09_29_Time_322_ms_(36.41%)_Space_39.6_MB_(18.97%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt b/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt index 936b0cc0d..ffbe95c14 100644 --- a/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0114_flatten_binary_tree_to_linked_list // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List -// #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) // #2022_09_27_Time_191_ms_(93.10%)_Space_35_MB_(97.70%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.kt index d03ea8f0f..6a26253af 100644 --- a/src/main/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii // #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Linked_List // #Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search -// #2022_10_08_Time_199_ms_(94.67%)_Space_37_MB_(93.33%) +// #Top_Interview_150_Binary_Tree_General #2022_10_08_Time_199_ms_(94.67%)_Space_37_MB_(93.33%) import com_github_leetcode.left_right.Node import java.util.LinkedList diff --git a/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt b/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt index 05248ad7e..c1cb7ea68 100644 --- a/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0120_triangle // #Medium #Array #Dynamic_Programming #Algorithm_I_Day_12_Dynamic_Programming -// #Dynamic_Programming_I_Day_13 #Udemy_Dynamic_Programming +// #Dynamic_Programming_I_Day_13 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP // #2022_10_08_Time_194_ms_(97.87%)_Space_40_MB_(71.28%) class Solution { diff --git a/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt b/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt index 5c41d64d6..9a39d5c25 100644 --- a/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt @@ -2,7 +2,8 @@ package g0101_0200.s0121_best_time_to_buy_and_sell_stock // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -// #Big_O_Time_O(N)_Space_O(1) #2022_09_03_Time_609_ms_(94.06%)_Space_57.3_MB_(94.43%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2022_09_03_Time_609_ms_(94.06%)_Space_57.3_MB_(94.43%) class Solution { fun maxProfit(prices: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.kt index 31fb6d7c6..2f50d9f3b 100644 --- a/src/main/kotlin/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution.kt @@ -1,7 +1,8 @@ package g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii // #Medium #Top_Interview_Questions #Array #Dynamic_Programming #Greedy #Dynamic_Programming_I_Day_7 -// #Udemy_Arrays #2022_11_25_Time_197_ms_(95.10%)_Space_35.3_MB_(96.33%) +// #Udemy_Arrays #Top_Interview_150_Array/String +// #2022_11_25_Time_197_ms_(95.10%)_Space_35.3_MB_(96.33%) class Solution { fun maxProfit(prices: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt b/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt index a69080c91..e4ea677ef 100644 --- a/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution.kt @@ -1,6 +1,7 @@ package g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii -// #Hard #Array #Dynamic_Programming #2022_10_08_Time_585_ms_(95.24%)_Space_55.8_MB_(92.86%) +// #Hard #Array #Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #2022_10_08_Time_585_ms_(95.24%)_Space_55.8_MB_(92.86%) class Solution { fun maxProfit(prices: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt b/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt index cce3eafc5..498fcc9e3 100644 --- a/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0124_binary_tree_maximum_path_sum // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -// #2022_09_03_Time_331_ms_(74.42%)_Space_45.1_MB_(59.88%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2022_09_03_Time_331_ms_(74.42%)_Space_45.1_MB_(59.88%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt b/src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt index c60cda33a..130910d48 100644 --- a/src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0125_valid_palindrome/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0125_valid_palindrome // #Easy #Top_Interview_Questions #String #Two_Pointers #Udemy_Two_Pointers -// #2022_10_08_Time_353_ms_(52.06%)_Space_39.2_MB_(73.02%) +// #Top_Interview_150_Two_Pointers #2022_10_08_Time_353_ms_(52.06%)_Space_39.2_MB_(73.02%) @Suppress("NAME_SHADOWING") class Solution { diff --git a/src/main/kotlin/g0101_0200/s0127_word_ladder/Solution.kt b/src/main/kotlin/g0101_0200/s0127_word_ladder/Solution.kt index 3e2fb33f9..160eb5b02 100644 --- a/src/main/kotlin/g0101_0200/s0127_word_ladder/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0127_word_ladder/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0127_word_ladder // #Hard #Top_Interview_Questions #String #Hash_Table #Breadth_First_Search -// #Graph_Theory_I_Day_12_Breadth_First_Search +// #Graph_Theory_I_Day_12_Breadth_First_Search #Top_Interview_150_Graph_BFS // #2022_10_08_Time_396_ms_(98.68%)_Space_49.1_MB_(80.26%) class Solution { diff --git a/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt b/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt index 61f929220..801c738a8 100644 --- a/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt @@ -1,7 +1,8 @@ package g0101_0200.s0128_longest_consecutive_sequence // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2022_09_03_Time_460_ms_(97.77%)_Space_51_MB_(99.32%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2022_09_03_Time_460_ms_(97.77%)_Space_51_MB_(99.32%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.kt b/src/main/kotlin/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.kt index 3828b48e6..d18f9ff07 100644 --- a/src/main/kotlin/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution.kt @@ -1,6 +1,6 @@ package g0101_0200.s0129_sum_root_to_leaf_numbers -// #Medium #Depth_First_Search #Tree #Binary_Tree +// #Medium #Depth_First_Search #Tree #Binary_Tree #Top_Interview_150_Binary_Tree_General // #2022_11_25_Time_237_ms_(52.50%)_Space_34.1_MB_(55.00%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0130_surrounded_regions/Solution.kt b/src/main/kotlin/g0101_0200/s0130_surrounded_regions/Solution.kt index a5974f7a5..42df01cb3 100644 --- a/src/main/kotlin/g0101_0200/s0130_surrounded_regions/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0130_surrounded_regions/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0130_surrounded_regions // #Medium #Top_Interview_Questions #Array #Depth_First_Search #Breadth_First_Search #Matrix // #Union_Find #Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search -// #2022_10_08_Time_355_ms_(84.42%)_Space_51.2_MB_(68.83%) +// #Top_Interview_150_Graph_General #2022_10_08_Time_355_ms_(84.42%)_Space_51.2_MB_(68.83%) class Solution { fun solve(board: Array) { diff --git a/src/main/kotlin/g0101_0200/s0133_clone_graph/Solution.kt b/src/main/kotlin/g0101_0200/s0133_clone_graph/Solution.kt index 4a8ac9e33..5580bd23b 100644 --- a/src/main/kotlin/g0101_0200/s0133_clone_graph/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0133_clone_graph/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0133_clone_graph // #Medium #Hash_Table #Depth_First_Search #Breadth_First_Search #Graph #Udemy_Graph -// #2022_10_09_Time_351_ms_(60.91%)_Space_37.1_MB_(70.56%) +// #Top_Interview_150_Graph_General #2022_10_09_Time_351_ms_(60.91%)_Space_37.1_MB_(70.56%) import com_github_leetcode.neighbors.Node diff --git a/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt b/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt index a8429aaaa..190d0dd06 100644 --- a/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0134_gas_station/Solution.kt @@ -1,6 +1,6 @@ package g0101_0200.s0134_gas_station -// #Medium #Top_Interview_Questions #Array #Greedy +// #Medium #Top_Interview_Questions #Array #Greedy #Top_Interview_150_Array/String // #2022_10_09_Time_545_ms_(70.18%)_Space_74.6_MB_(45.61%) class Solution { diff --git a/src/main/kotlin/g0101_0200/s0135_candy/Solution.kt b/src/main/kotlin/g0101_0200/s0135_candy/Solution.kt index 14a751fab..30f2f2a07 100644 --- a/src/main/kotlin/g0101_0200/s0135_candy/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0135_candy/Solution.kt @@ -1,6 +1,7 @@ package g0101_0200.s0135_candy -// #Hard #Array #Greedy #2022_10_09_Time_466_ms_(58.33%)_Space_51.2_MB_(83.33%) +// #Hard #Array #Greedy #Top_Interview_150_Array/String +// #2022_10_09_Time_466_ms_(58.33%)_Space_51.2_MB_(83.33%) class Solution { fun candy(ratings: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt index 44572c221..31c03a1f3 100644 --- a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt @@ -2,7 +2,8 @@ package g0101_0200.s0136_single_number // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation // #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers -// #Big_O_Time_O(N)_Space_O(1) #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%) +// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1) +// #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%) class Solution { fun singleNumber(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0137_single_number_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0137_single_number_ii/Solution.kt index 4e80172d6..77a6fb34c 100644 --- a/src/main/kotlin/g0101_0200/s0137_single_number_ii/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0137_single_number_ii/Solution.kt @@ -1,6 +1,7 @@ package g0101_0200.s0137_single_number_ii -// #Medium #Array #Bit_Manipulation #2022_10_09_Time_344_ms_(64.29%)_Space_38.4_MB_(92.86%) +// #Medium #Array #Bit_Manipulation #Top_Interview_150_Bit_Manipulation +// #2022_10_09_Time_344_ms_(64.29%)_Space_38.4_MB_(92.86%) class Solution { fun singleNumber(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt b/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt index 27238588a..70b4013e9 100644 --- a/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0138_copy_list_with_random_pointer // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List -// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) -// #2022_09_03_Time_274_ms_(80.58%)_Space_40.5_MB_(58.99%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2022_09_03_Time_274_ms_(80.58%)_Space_40.5_MB_(58.99%) import com_github_leetcode.random.Node diff --git a/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt b/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt index 8de5c96c0..8470b6039 100644 --- a/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt @@ -2,8 +2,8 @@ package g0101_0200.s0139_word_break // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -// #2022_09_03_Time_197_ms_(87.17%)_Space_34.4_MB_(99.25%) +// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2022_09_03_Time_197_ms_(87.17%)_Space_34.4_MB_(99.25%) import java.util.HashSet diff --git a/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt b/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt index 809cd6c3f..5d16bc854 100644 --- a/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0141_linked_list_cycle // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List -// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2022_09_18_Time_223_ms_(91.85%)_Space_38.2_MB_(87.85%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2022_09_18_Time_223_ms_(91.85%)_Space_38.2_MB_(87.85%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt b/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt index e1ed071d2..13d4ee50d 100644 --- a/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt +++ b/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt @@ -1,8 +1,8 @@ package g0101_0200.s0146_lru_cache // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -// #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -// #2022_09_03_Time_1116_ms_(97.93%)_Space_139.6_MB_(97.51%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2022_09_03_Time_1116_ms_(97.93%)_Space_139.6_MB_(97.51%) class LRUCache(capacity: Int) { private val nodeMap = HashMap() diff --git a/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt b/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt index 3cd57aa41..f8a6c1a84 100644 --- a/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0148_sort_list // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -// #2022_09_06_Time_820_ms_(61.70%)_Space_76_MB_(28.72%) +// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(log(N))_Space_O(log(N)) #2022_09_06_Time_820_ms_(61.70%)_Space_76_MB_(28.72%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0101_0200/s0149_max_points_on_a_line/Solution.kt b/src/main/kotlin/g0101_0200/s0149_max_points_on_a_line/Solution.kt index afb0cbab7..0ed8ef29d 100644 --- a/src/main/kotlin/g0101_0200/s0149_max_points_on_a_line/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0149_max_points_on_a_line/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0149_max_points_on_a_line // #Hard #Top_Interview_Questions #Array #Hash_Table #Math #Geometry #Algorithm_II_Day_21_Others -// #2022_10_09_Time_307_ms_(83.33%)_Space_34.5_MB_(100.00%) +// #Top_Interview_150_Math #2022_10_09_Time_307_ms_(83.33%)_Space_34.5_MB_(100.00%) class Solution { fun maxPoints(points: Array): Int { diff --git a/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt b/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt index 777709b11..863396779 100644 --- a/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0150_evaluate_reverse_polish_notation/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0150_evaluate_reverse_polish_notation // #Medium #Top_Interview_Questions #Array #Math #Stack #Programming_Skills_II_Day_3 -// #2022_10_09_Time_233_ms_(88.82%)_Space_36.7_MB_(91.45%) +// #Top_Interview_150_Stack #2022_10_09_Time_233_ms_(88.82%)_Space_36.7_MB_(91.45%) class Solution { val op = mapOf Int>( diff --git a/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt b/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt index 84fe850b8..e972bb4e4 100644 --- a/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt @@ -1,6 +1,6 @@ package g0101_0200.s0151_reverse_words_in_a_string -// #Medium #String #Two_Pointers #Udemy_Strings +// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String // #2022_10_11_Time_206_ms_(98.90%)_Space_36.1_MB_(96.70%) class Solution { diff --git a/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt b/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt index 8c9df2a19..0db9e73d5 100644 --- a/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0153_find_minimum_in_rotated_sorted_array // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -// #2022_09_06_Time_262_ms_(60.96%)_Space_35.4_MB_(86.45%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2022_09_06_Time_262_ms_(60.96%)_Space_35.4_MB_(86.45%) class Solution { private fun findMinUtil(nums: IntArray, l: Int, r: Int): Int { diff --git a/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt b/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt index 6ed23aed0..85d1230aa 100644 --- a/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt +++ b/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt @@ -2,7 +2,7 @@ package g0101_0200.s0155_min_stack // #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) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) // #2022_09_06_Time_331_ms_(84.88%)_Space_54.3_MB_(46.34%) class MinStack() { diff --git a/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt b/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt index 3336e9927..bc7260d73 100644 --- a/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt @@ -1,7 +1,8 @@ package g0101_0200.s0162_find_peak_element // #Medium #Top_Interview_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_II_Day_12 #2022_10_11_Time_297_ms_(53.85%)_Space_36.8_MB_(66.27%) +// #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search +// #2022_10_11_Time_297_ms_(53.85%)_Space_36.8_MB_(66.27%) class Solution { fun findPeakElement(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt b/src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt index 2cdfbeb31..b3c45b184 100644 --- a/src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt @@ -1,7 +1,8 @@ package g0101_0200.s0167_two_sum_ii_input_array_is_sorted // #Medium #Array #Binary_Search #Two_Pointers #Algorithm_I_Day_3_Two_Pointers -// #Binary_Search_I_Day_7 #2022_10_11_Time_403_ms_(68.74%)_Space_47.2_MB_(58.24%) +// #Binary_Search_I_Day_7 #Top_Interview_150_Two_Pointers +// #2022_10_11_Time_403_ms_(68.74%)_Space_47.2_MB_(58.24%) class Solution { fun twoSum(numbers: IntArray, target: Int): IntArray { diff --git a/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt b/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt index b7095880a..fdacdbbd5 100644 --- a/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt @@ -2,7 +2,8 @@ package g0101_0200.s0169_majority_element // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) #2022_09_08_Time_460_ms_(51.25%)_Space_52.9_MB_(52.64%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2022_09_08_Time_460_ms_(51.25%)_Space_52.9_MB_(52.64%) class Solution { fun majorityElement(arr: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0172_factorial_trailing_zeroes/Solution.kt b/src/main/kotlin/g0101_0200/s0172_factorial_trailing_zeroes/Solution.kt index 4e8540057..c644535e3 100644 --- a/src/main/kotlin/g0101_0200/s0172_factorial_trailing_zeroes/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0172_factorial_trailing_zeroes/Solution.kt @@ -1,6 +1,6 @@ package g0101_0200.s0172_factorial_trailing_zeroes -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Top_Interview_150_Math // #2022_10_12_Time_220_ms_(67.65%)_Space_34.2_MB_(14.71%) class Solution { diff --git a/src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt b/src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt index 5ef871443..b7d95570f 100644 --- a/src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt +++ b/src/main/kotlin/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.kt @@ -2,7 +2,7 @@ package g0101_0200.s0173_binary_search_tree_iterator // #Medium #Tree #Binary_Tree #Stack #Design #Binary_Search_Tree #Iterator // #Data_Structure_II_Day_17_Tree #Programming_Skills_II_Day_16 #Level_2_Day_9_Binary_Search_Tree -// #2022_10_12_Time_563_ms_(46.91%)_Space_60.5_MB_(66.67%) +// #Top_Interview_150_Binary_Tree_General #2022_10_12_Time_563_ms_(46.91%)_Space_60.5_MB_(66.67%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.kt b/src/main/kotlin/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.kt index 4fc5b4a17..579bbb8e0 100644 --- a/src/main/kotlin/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv/Solution.kt @@ -1,6 +1,7 @@ package g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv -// #Hard #Array #Dynamic_Programming #2022_10_18_Time_293_ms_(68.31%)_Space_34.9_MB_(84.15%) +// #Hard #Array #Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #2022_10_18_Time_293_ms_(68.31%)_Space_34.9_MB_(84.15%) class Solution { fun maxProfit(k: Int, prices: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt b/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt index 363bdbf4f..e6f1a7c6d 100644 --- a/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt @@ -1,8 +1,8 @@ package g0101_0200.s0189_rotate_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2022_09_08_Time_483_ms_(86.95%)_Space_71.9_MB_(50.13%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2022_09_08_Time_483_ms_(86.95%)_Space_71.9_MB_(50.13%) @Suppress("NAME_SHADOWING") class Solution { diff --git a/src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt b/src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt index 4e532cd2e..13a67fa8a 100644 --- a/src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0190_reverse_bits // #Easy #Top_Interview_Questions #Bit_Manipulation #Divide_and_Conquer -// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Bit_Manipulation +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Bit_Manipulation #Top_Interview_150_Bit_Manipulation // #2022_10_18_Time_198_ms_(81.82%)_Space_32.8_MB_(73.86%) @Suppress("NAME_SHADOWING") diff --git a/src/main/kotlin/g0101_0200/s0191_number_of_1_bits/Solution.kt b/src/main/kotlin/g0101_0200/s0191_number_of_1_bits/Solution.kt index bd288c7ed..06f133bdc 100644 --- a/src/main/kotlin/g0101_0200/s0191_number_of_1_bits/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0191_number_of_1_bits/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0191_number_of_1_bits // #Easy #Top_Interview_Questions #Bit_Manipulation #Algorithm_I_Day_13_Bit_Manipulation -// #Programming_Skills_I_Day_2_Operator #Udemy_Bit_Manipulation +// #Programming_Skills_I_Day_2_Operator #Udemy_Bit_Manipulation #Top_Interview_150_Bit_Manipulation // #2022_10_18_Time_237_ms_(68.44%)_Space_33.8_MB_(52.46%) class Solution { diff --git a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt index aba54d778..3d30e4a41 100644 --- a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt @@ -2,8 +2,8 @@ package g0101_0200.s0198_house_robber // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2022_09_08_Time_156_ms_(92.24%)_Space_34.1_MB_(61.64%) +// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2022_09_08_Time_156_ms_(92.24%)_Space_34.1_MB_(61.64%) class Solution { fun rob(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt b/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt index 7bd605cb2..96319387d 100644 --- a/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0199_binary_tree_right_side_view // #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree +// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree #Top_Interview_150_Binary_Tree_BFS // #2022_09_09_Time_194_ms_(92.89%)_Space_35.4_MB_(67.89%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt b/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt index e2ae2b03d..453e0cd0b 100644 --- a/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt @@ -4,7 +4,8 @@ package g0101_0200.s0200_number_of_islands // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) #2022_09_09_Time_252_ms_(95.41%)_Space_52.4_MB_(86.52%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2022_09_09_Time_252_ms_(95.41%)_Space_52.4_MB_(86.52%) class Solution { fun numIslands(grid: Array): Int { diff --git a/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt b/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt index 03c7593f3..301ef7911 100644 --- a/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.kt @@ -1,7 +1,7 @@ package g0201_0300.s0201_bitwise_and_of_numbers_range // #Medium #Bit_Manipulation #Algorithm_II_Day_19_Bit_Manipulation -// #2022_10_19_Time_368_ms_(80.00%)_Space_37.1_MB_(76.67%) +// #Top_Interview_150_Bit_Manipulation #2022_10_19_Time_368_ms_(80.00%)_Space_37.1_MB_(76.67%) class Solution { fun rangeBitwiseAnd(left: Int, right: Int): Int { diff --git a/src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt b/src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt index 3d1036197..5579081d8 100644 --- a/src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0202_happy_number/Solution.kt @@ -2,7 +2,7 @@ package g0201_0300.s0202_happy_number // #Easy #Top_Interview_Questions #Hash_Table #Math #Two_Pointers #Algorithm_II_Day_21_Others // #Programming_Skills_I_Day_4_Loop #Level_2_Day_1_Implementation/Simulation -// #2022_10_19_Time_261_ms_(45.08%)_Space_33.7_MB_(78.51%) +// #Top_Interview_150_Hashmap #2022_10_19_Time_261_ms_(45.08%)_Space_33.7_MB_(78.51%) class Solution { private val set = mutableSetOf() diff --git a/src/main/kotlin/g0201_0300/s0205_isomorphic_strings/Solution.kt b/src/main/kotlin/g0201_0300/s0205_isomorphic_strings/Solution.kt index e547881ce..1e00d8e9d 100644 --- a/src/main/kotlin/g0201_0300/s0205_isomorphic_strings/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0205_isomorphic_strings/Solution.kt @@ -1,6 +1,6 @@ package g0201_0300.s0205_isomorphic_strings -// #Easy #String #Hash_Table #Level_1_Day_2_String +// #Easy #String #Hash_Table #Level_1_Day_2_String #Top_Interview_150_Hashmap // #2022_10_20_Time_278_ms_(79.96%)_Space_37.7_MB_(72.52%) class Solution { diff --git a/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt b/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt index ac7754feb..694d90bdb 100644 --- a/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt @@ -1,8 +1,8 @@ package g0201_0300.s0207_course_schedule // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -// #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -// #2024_01_16_Time_183_ms_(92.07%)_Space_39.1_MB_(81.50%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_01_16_Time_183_ms_(92.07%)_Space_39.1_MB_(81.50%) class Solution { fun canFinish(numCourses: Int, prerequisites: Array): Boolean { diff --git a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt index f35e846d1..7b1951ff2 100644 --- a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt +++ b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt @@ -1,7 +1,7 @@ package g0201_0300.s0208_implement_trie_prefix_tree // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap +// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2022_09_10_Time_689_ms_(61.00%)_Space_87.9_MB_(36.00%) diff --git a/src/main/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/Solution.kt b/src/main/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/Solution.kt index 9b1b481bd..7b9d18330 100644 --- a/src/main/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0209_minimum_size_subarray_sum/Solution.kt @@ -1,7 +1,8 @@ package g0201_0300.s0209_minimum_size_subarray_sum // #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window #Algorithm_II_Day_5_Sliding_Window -// #Binary_Search_II_Day_1 #2022_10_20_Time_315_ms_(96.73%)_Space_46.7_MB_(90.20%) +// #Binary_Search_II_Day_1 #Top_Interview_150_Sliding_Window +// #2022_10_20_Time_315_ms_(96.73%)_Space_46.7_MB_(90.20%) class Solution { fun minSubArrayLen(s: Int, nums: IntArray): Int { diff --git a/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt b/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt index 1daf48b76..90dd74162 100644 --- a/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0210_course_schedule_ii/Solution.kt @@ -1,7 +1,7 @@ package g0201_0300.s0210_course_schedule_ii // #Medium #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search #Graph -// #Topological_Sort #Level_2_Day_11_Graph/BFS/DFS +// #Topological_Sort #Level_2_Day_11_Graph/BFS/DFS #Top_Interview_150_Graph_General // #2022_10_20_Time_266_ms_(96.32%)_Space_45.9_MB_(92.65%) class Solution { diff --git a/src/main/kotlin/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.kt b/src/main/kotlin/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.kt index 2c001452e..ddc122874 100644 --- a/src/main/kotlin/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.kt +++ b/src/main/kotlin/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.kt @@ -1,6 +1,6 @@ package g0201_0300.s0211_design_add_and_search_words_data_structure -// #Medium #String #Depth_First_Search #Design #Trie +// #Medium #String #Depth_First_Search #Design #Trie #Top_Interview_150_Trie // #2022_10_24_Time_2256_ms_(87.04%)_Space_237.4_MB_(83.33%) class WordDictionary { diff --git a/src/main/kotlin/g0201_0300/s0212_word_search_ii/Solution.kt b/src/main/kotlin/g0201_0300/s0212_word_search_ii/Solution.kt index e8857e375..8ca3f24f0 100644 --- a/src/main/kotlin/g0201_0300/s0212_word_search_ii/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0212_word_search_ii/Solution.kt @@ -1,6 +1,6 @@ package g0201_0300.s0212_word_search_ii -// #Hard #Top_Interview_Questions #Array #String #Matrix #Backtracking #Trie +// #Hard #Top_Interview_Questions #Array #String #Matrix #Backtracking #Trie #Top_Interview_150_Trie // #2022_10_24_Time_268_ms_(100.00%)_Space_37.5_MB_(95.08%) @Suppress("NAME_SHADOWING") diff --git a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt index 75448042b..659dccf5e 100644 --- a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt @@ -2,7 +2,8 @@ package g0201_0300.s0215_kth_largest_element_in_an_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue // #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2022_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n)) +// #2022_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%) class Solution { fun findKthLargest(nums: IntArray, k: Int): Int { diff --git a/src/main/kotlin/g0201_0300/s0219_contains_duplicate_ii/Solution.kt b/src/main/kotlin/g0201_0300/s0219_contains_duplicate_ii/Solution.kt index ad15ed8f3..44120aa17 100644 --- a/src/main/kotlin/g0201_0300/s0219_contains_duplicate_ii/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0219_contains_duplicate_ii/Solution.kt @@ -1,6 +1,7 @@ package g0201_0300.s0219_contains_duplicate_ii -// #Easy #Array #Hash_Table #Sliding_Window #2022_10_25_Time_813_ms_(80.46%)_Space_71.1_MB_(81.22%) +// #Easy #Array #Hash_Table #Sliding_Window #Top_Interview_150_Hashmap +// #2022_10_25_Time_813_ms_(80.46%)_Space_71.1_MB_(81.22%) class Solution { fun containsNearbyDuplicate(nums: IntArray, k: Int): Boolean { diff --git a/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt b/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt index 08393a667..a0888f38f 100644 --- a/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt @@ -1,7 +1,8 @@ package g0201_0300.s0221_maximal_square // #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 -// #Big_O_Time_O(m*n)_Space_O(m*n) #2022_09_10_Time_614_ms_(44.00%)_Space_76.2_MB_(65.33%) +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2022_09_10_Time_614_ms_(44.00%)_Space_76.2_MB_(65.33%) class Solution { fun maximalSquare(matrix: Array): Int { diff --git a/src/main/kotlin/g0201_0300/s0224_basic_calculator/Solution.kt b/src/main/kotlin/g0201_0300/s0224_basic_calculator/Solution.kt index 0e9a5b138..5c7a880b0 100644 --- a/src/main/kotlin/g0201_0300/s0224_basic_calculator/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0224_basic_calculator/Solution.kt @@ -1,6 +1,7 @@ package g0201_0300.s0224_basic_calculator -// #Hard #String #Math #Stack #Recursion #2022_10_25_Time_294_ms_(93.33%)_Space_40.3_MB_(90.00%) +// #Hard #String #Math #Stack #Recursion #Top_Interview_150_Stack +// #2022_10_25_Time_294_ms_(93.33%)_Space_40.3_MB_(90.00%) class Solution { private var i = 0 diff --git a/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt index 0bb6e8340..13863da26 100644 --- a/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt @@ -2,7 +2,8 @@ package g0201_0300.s0226_invert_binary_tree // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) #2022_09_27_Time_233_ms_(54.90%)_Space_34.5_MB_(11.33%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2022_09_27_Time_233_ms_(54.90%)_Space_34.5_MB_(11.33%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0228_summary_ranges/Solution.kt b/src/main/kotlin/g0201_0300/s0228_summary_ranges/Solution.kt index 1a1b340a0..d3dbc8e65 100644 --- a/src/main/kotlin/g0201_0300/s0228_summary_ranges/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0228_summary_ranges/Solution.kt @@ -1,6 +1,6 @@ package g0201_0300.s0228_summary_ranges -// #Easy #Array #2022_10_26_Time_169_ms_(91.89%)_Space_34_MB_(95.95%) +// #Easy #Array #Top_Interview_150_Intervals #2022_10_26_Time_169_ms_(91.89%)_Space_34_MB_(95.95%) class Solution { fun summaryRanges(nums: IntArray): List { diff --git a/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt b/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt index c0385d14b..9108b9b26 100644 --- a/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt @@ -1,7 +1,8 @@ package g0201_0300.s0230_kth_smallest_element_in_a_bst // #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) +// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) // #2022_09_10_Time_393_ms_(33.33%)_Space_41.8_MB_(66.67%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt index 816087b83..99698cb75 100644 --- a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt @@ -1,8 +1,8 @@ package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) -// #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%) +// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(n)_Space_O(n) #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt index 0d00667fc..cc14941de 100644 --- a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt @@ -1,7 +1,8 @@ package g0201_0300.s0238_product_of_array_except_self // #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays -// #Big_O_Time_O(n^2)_Space_O(n) #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n) +// #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%) class Solution { fun productExceptSelf(nums: IntArray): IntArray { diff --git a/src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt b/src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt index c494626e6..969148b3f 100644 --- a/src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt @@ -1,7 +1,7 @@ package g0201_0300.s0242_valid_anagram // #Easy #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String -// #Programming_Skills_I_Day_11_Containers_and_Libraries #Udemy_Strings +// #Programming_Skills_I_Day_11_Containers_and_Libraries #Udemy_Strings #Top_Interview_150_Hashmap // #2022_10_27_Time_251_ms_(87.65%)_Space_39.1_MB_(69.49%) class Solution { diff --git a/src/main/kotlin/g0201_0300/s0274_h_index/Solution.kt b/src/main/kotlin/g0201_0300/s0274_h_index/Solution.kt index 1088cce50..5075bfd1f 100644 --- a/src/main/kotlin/g0201_0300/s0274_h_index/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0274_h_index/Solution.kt @@ -1,6 +1,7 @@ package g0201_0300.s0274_h_index -// #Medium #Array #Sorting #Counting_Sort #2022_11_04_Time_291_ms_(45.45%)_Space_34.7_MB_(100.00%) +// #Medium #Array #Sorting #Counting_Sort #Top_Interview_150_Array/String +// #2022_11_04_Time_291_ms_(45.45%)_Space_34.7_MB_(100.00%) class Solution { fun hIndex(citations: IntArray): Int { diff --git a/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt b/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt index f662081e7..5fa2908ca 100644 --- a/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0289_game_of_life/Solution.kt @@ -1,6 +1,7 @@ package g0201_0300.s0289_game_of_life -// #Medium #Array #Matrix #Simulation #2022_11_04_Time_174_ms_(96.97%)_Space_34.2_MB_(93.94%) +// #Medium #Array #Matrix #Simulation #Top_Interview_150_Matrix +// #2022_11_04_Time_174_ms_(96.97%)_Space_34.2_MB_(93.94%) class Solution { companion object { diff --git a/src/main/kotlin/g0201_0300/s0290_word_pattern/Solution.kt b/src/main/kotlin/g0201_0300/s0290_word_pattern/Solution.kt index 997e9c0ca..5cb1f5b6d 100644 --- a/src/main/kotlin/g0201_0300/s0290_word_pattern/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0290_word_pattern/Solution.kt @@ -1,6 +1,6 @@ package g0201_0300.s0290_word_pattern -// #Easy #String #Hash_Table #Data_Structure_II_Day_7_String +// #Easy #String #Hash_Table #Data_Structure_II_Day_7_String #Top_Interview_150_Hashmap // #2022_11_04_Time_177_ms_(89.55%)_Space_35.2_MB_(95.52%) class Solution { diff --git a/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt b/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt index 9027e2d72..acd7bc13e 100644 --- a/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt +++ b/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt @@ -1,7 +1,8 @@ package g0201_0300.s0295_find_median_from_data_stream // #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_09_11_Time_2289_ms_(33.60%)_Space_153.3_MB_(5.74%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2022_09_11_Time_2289_ms_(33.60%)_Space_153.3_MB_(5.74%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt b/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt index 75385e9aa..adf0f5b81 100644 --- a/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt @@ -2,7 +2,7 @@ package g0201_0300.s0300_longest_increasing_subsequence // #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) +// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) // #2022_09_11_Time_318_ms_(82.28%)_Space_39.2_MB_(82.77%) class Solution { diff --git a/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt b/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt index 3e066356e..5cad29afe 100644 --- a/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt @@ -2,7 +2,7 @@ package g0301_0400.s0322_coin_change // #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) +// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) // #2022_09_11_Time_332_ms_(50.68%)_Space_37.6_MB_(79.93%) class Solution { diff --git a/src/main/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.kt b/src/main/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.kt index 8f5257945..845f351a7 100644 --- a/src/main/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0373_find_k_pairs_with_smallest_sums/Solution.kt @@ -1,6 +1,7 @@ package g0301_0400.s0373_find_k_pairs_with_smallest_sums -// #Medium #Array #Heap_Priority_Queue #2022_11_22_Time_1809_ms_(80.95%)_Space_119.1_MB_(66.67%) +// #Medium #Array #Heap_Priority_Queue #Top_Interview_150_Heap +// #2022_11_22_Time_1809_ms_(80.95%)_Space_119.1_MB_(66.67%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.kt b/src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.kt index 8651c0ad5..848bd9fc4 100644 --- a/src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.kt +++ b/src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.kt @@ -1,7 +1,7 @@ package g0301_0400.s0380_insert_delete_getrandom_o1 // #Medium #Array #Hash_Table #Math #Design #Randomized #Programming_Skills_II_Day_20 -// #2022_11_22_Time_1326_ms_(68.23%)_Space_119.7_MB_(83.53%) +// #Top_Interview_150_Array/String #2022_11_22_Time_1326_ms_(68.23%)_Space_119.7_MB_(83.53%) import kotlin.random.Random diff --git a/src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt b/src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt index 7e2ef3b74..b2f105106 100644 --- a/src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0383_ransom_note/Solution.kt @@ -1,6 +1,6 @@ package g0301_0400.s0383_ransom_note -// #Easy #String #Hash_Table #Counting #Data_Structure_I_Day_6_String +// #Easy #String #Hash_Table #Counting #Data_Structure_I_Day_6_String #Top_Interview_150_Hashmap // #2022_11_24_Time_333_ms_(79.58%)_Space_45.2_MB_(75.39%) class Solution { diff --git a/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt b/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt index 68d83d8e4..1236444c6 100644 --- a/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt @@ -1,7 +1,7 @@ package g0301_0400.s0392_is_subsequence // #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19 -// #Level_1_Day_2_String #Udemy_Two_Pointers +// #Level_1_Day_2_String #Udemy_Two_Pointers #Top_Interview_150_Two_Pointers // #2022_11_25_Time_156_ms_(87.74%)_Space_33.9_MB_(90.11%) class Solution { diff --git a/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt b/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt index ca37158dc..50dabe81a 100644 --- a/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt @@ -1,7 +1,7 @@ package g0301_0400.s0399_evaluate_division // #Medium #Array #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #Shortest_Path -// #2022_11_29_Time_183_ms_(91.49%)_Space_34.6_MB_(95.74%) +// #Top_Interview_150_Graph_General #2022_11_29_Time_183_ms_(91.49%)_Space_34.6_MB_(95.74%) @Suppress("kotlin:S6518") class Solution { diff --git a/src/main/kotlin/g0401_0500/s0427_construct_quad_tree/Solution.kt b/src/main/kotlin/g0401_0500/s0427_construct_quad_tree/Solution.kt index d41449aa8..c848369c7 100644 --- a/src/main/kotlin/g0401_0500/s0427_construct_quad_tree/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0427_construct_quad_tree/Solution.kt @@ -1,6 +1,6 @@ package g0401_0500.s0427_construct_quad_tree -// #Medium #Array #Tree #Matrix #Divide_and_Conquer +// #Medium #Array #Tree #Matrix #Divide_and_Conquer #Top_Interview_150_Divide_and_Conquer // #2022_12_08_Time_221_ms_(94.74%)_Space_36.9_MB_(94.74%) /* diff --git a/src/main/kotlin/g0401_0500/s0433_minimum_genetic_mutation/Solution.kt b/src/main/kotlin/g0401_0500/s0433_minimum_genetic_mutation/Solution.kt index cb9cece30..706458393 100644 --- a/src/main/kotlin/g0401_0500/s0433_minimum_genetic_mutation/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0433_minimum_genetic_mutation/Solution.kt @@ -1,7 +1,7 @@ package g0401_0500.s0433_minimum_genetic_mutation // #Medium #String #Hash_Table #Breadth_First_Search #Graph_Theory_I_Day_12_Breadth_First_Search -// #2022_12_21_Time_204_ms_(82.08%)_Space_34.5_MB_(82.08%) +// #Top_Interview_150_Graph_BFS #2022_12_21_Time_204_ms_(82.08%)_Space_34.5_MB_(82.08%) import java.util.LinkedList import java.util.Queue diff --git a/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt b/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt index 80b5f7eb0..77bf61a37 100644 --- a/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt @@ -1,6 +1,7 @@ package g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons -// #Medium #Array #Sorting #Greedy #2022_12_25_Time_934_ms_(100.00%)_Space_87_MB_(100.00%) +// #Medium #Array #Sorting #Greedy #Top_Interview_150_Intervals +// #2022_12_25_Time_934_ms_(100.00%)_Space_87_MB_(100.00%) class Solution { /* diff --git a/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt b/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt index 7514956fe..5f8098757 100644 --- a/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt +++ b/src/main/kotlin/g0501_0600/s0502_ipo/Solution.kt @@ -1,6 +1,6 @@ package g0501_0600.s0502_ipo -// #Hard #Array #Sorting #Greedy #Heap_Priority_Queue +// #Hard #Array #Sorting #Greedy #Heap_Priority_Queue #Top_Interview_150_Heap // #2023_01_06_Time_799_ms_(54.55%)_Space_88.5_MB_(9.09%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.kt b/src/main/kotlin/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.kt index 499813396..13c1b618e 100644 --- a/src/main/kotlin/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.kt +++ b/src/main/kotlin/g0501_0600/s0530_minimum_absolute_difference_in_bst/Solution.kt @@ -1,7 +1,7 @@ package g0501_0600.s0530_minimum_absolute_difference_in_bst // #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Binary_Search_Tree -// #2023_01_15_Time_209_ms_(86.96%)_Space_38.5_MB_(69.57%) +// #Top_Interview_150_Binary_Search_Tree #2023_01_15_Time_209_ms_(86.96%)_Space_38.5_MB_(69.57%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.kt b/src/main/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.kt index 783349aca..b505c6b43 100644 --- a/src/main/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.kt +++ b/src/main/kotlin/g0601_0700/s0637_average_of_levels_in_binary_tree/Solution.kt @@ -1,7 +1,7 @@ package g0601_0700.s0637_average_of_levels_in_binary_tree // #Easy #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree -// #2023_02_10_Time_249_ms_(100.00%)_Space_39.5_MB_(72.73%) +// #Top_Interview_150_Binary_Tree_BFS #2023_02_10_Time_249_ms_(100.00%)_Space_39.5_MB_(72.73%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0901_1000/s0909_snakes_and_ladders/Solution.kt b/src/main/kotlin/g0901_1000/s0909_snakes_and_ladders/Solution.kt index 0cd13107d..ef102684a 100644 --- a/src/main/kotlin/g0901_1000/s0909_snakes_and_ladders/Solution.kt +++ b/src/main/kotlin/g0901_1000/s0909_snakes_and_ladders/Solution.kt @@ -1,6 +1,6 @@ package g0901_1000.s0909_snakes_and_ladders -// #Medium #Array #Breadth_First_Search #Matrix +// #Medium #Array #Breadth_First_Search #Matrix #Top_Interview_150_Graph_BFS // #2023_04_15_Time_203_ms_(100.00%)_Space_36_MB_(100.00%) import java.util.LinkedList diff --git a/src/main/kotlin/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.kt b/src/main/kotlin/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.kt index 47f4a970f..964cf728d 100644 --- a/src/main/kotlin/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.kt +++ b/src/main/kotlin/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.kt @@ -1,7 +1,8 @@ package g0901_1000.s0918_maximum_sum_circular_subarray // #Medium #Array #Dynamic_Programming #Divide_and_Conquer #Queue #Monotonic_Queue -// #Dynamic_Programming_I_Day_5 #2023_04_16_Time_339_ms_(86.96%)_Space_46.4_MB_(56.52%) +// #Dynamic_Programming_I_Day_5 #Top_Interview_150_Kadane's_Algorithm +// #2023_04_16_Time_339_ms_(86.96%)_Space_46.4_MB_(56.52%) class Solution { private fun kadane(nums: IntArray, sign: Int): Int {