diff --git a/README.md b/README.md
index ef139653f..c74c1782e 100644
--- a/README.md
+++ b/README.md
@@ -94,7 +94,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 1588 |[Sum of All Odd Length Subarrays](src/main/kotlin/g1501_1600/s1588_sum_of_all_odd_length_subarrays/Solution.kt)| Easy | Array, Math, Prefix_Sum | 157 | 64.00
-| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07
+| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07
 | 1672 |[Richest Customer Wealth](src/main/kotlin/g1601_1700/s1672_richest_customer_wealth/Solution.kt)| Easy | Array, Matrix | 155 | 94.54
 
 #### Day 7 Array
@@ -135,7 +135,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 |-|-|-|-|-|-
 | 1356 |[Sort Integers by The Number of 1 Bits](src/main/kotlin/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits/Solution.kt)| Easy | Array, Sorting, Bit_Manipulation, Counting | 236 | 92.31
 | 0232 |[Implement Queue using Stacks](src/main/kotlin/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.kt)| Easy | Stack, Design, Queue | 258 | 70.86
-| 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 251 | 87.65
+| 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | String, Hash_Table, Sorting | 251 | 87.65
 | 0217 |[Contains Duplicate](src/main/kotlin/g0201_0300/s0217_contains_duplicate/Solution.kt)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49
 
 #### Day 12 Class and Object
@@ -200,7 +200,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0054 |[Spiral Matrix](src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt)| Medium | Top_Interview_Questions, Array, Matrix, Simulation | 132 | 95.12
+| 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
 | 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
 
 #### Day 9
@@ -270,8 +270,8 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88
-| 0341 |[Flatten Nested List Iterator](src/main/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.kt)| Medium | Top_Interview_Questions, Depth_First_Search, Tree, Stack, Design, Queue, Iterator | 210 | 100.00
+| 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
+| 0341 |[Flatten Nested List Iterator](src/main/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.kt)| Medium | Depth_First_Search, Tree, Stack, Design, Queue, Iterator | 210 | 100.00
 
 #### Day 19
 
@@ -284,7 +284,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0380 |[Insert Delete GetRandom O(1)](src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1/RandomizedSet.kt)| Medium | Top_Interview_Questions, Array, Hash_Table, Math, Design, Randomized | 1326 | 68.23
+| 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
 | 0622 |[Design Circular Queue](src/main/kotlin/g0601_0700/s0622_design_circular_queue/MyCircularQueue.kt)| Medium | Array, Design, Linked_List, Queue | 234 | 92.68
 | 0729 |[My Calendar I](src/main/kotlin/g0701_0800/s0729_my_calendar_i/MyCalendar.kt)| Medium | Binary_Search, Design, Ordered_Set, Segment_Tree | 378 | 69.70
 
@@ -525,7 +525,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Array, Binary_Search | 261 | 77.91
+| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 261 | 77.91
 | 0278 |[First Bad Version](src/main/kotlin/g0201_0300/s0278_first_bad_version/Solution.kt)| Easy | Binary_Search, Interactive | 349 | 76.86
 
 #### Day 8 Binary Search Tree
@@ -533,7 +533,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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
-| 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)| Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 404 | 75.59
+| 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
 
 #### Day 9 Graph/BFS/DFS
 
@@ -591,14 +591,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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
-| 0054 |[Spiral Matrix](src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt)| Medium | Top_Interview_Questions, Array, Matrix, Simulation | 132 | 95.12
+| 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
 | 1706 |[Where Will the Ball Fall](src/main/kotlin/g1701_1800/s1706_where_will_the_ball_fall/Solution.kt)| Medium | Array, Dynamic_Programming, Depth_First_Search, Matrix, Simulation | 270 | 67.86
 
 #### Day 2 String
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0014 |[Longest Common Prefix](src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt)| Easy | Top_Interview_Questions, String | 154 | 89.70
+| 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
 | 0043 |[Multiply Strings](src/main/kotlin/g0001_0100/s0043_multiply_strings/Solution.kt)| Medium | String, Math, Simulation | 165 | 96.72
 
 #### Day 3 Linked List
@@ -606,13 +606,13 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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
-| 0234 |[Palindrome Linked List](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 641 | 79.53
+| 0234 |[Palindrome Linked List](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 641 | 79.53
 
 #### Day 4 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Top_Interview_Questions, Linked_List | 216 | 86.96
+| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Linked_List | 216 | 86.96
 | 0148 |[Sort List](src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 820 | 61.70
 
 #### Day 5 Greedy
@@ -634,7 +634,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0543 |[Diameter of Binary Tree](src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 307 | 43.93
-| 0437 |[Path Sum III](src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 403 | 54.12
+| 0437 |[Path Sum III](src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt)| Medium | Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 403 | 54.12
 
 #### Day 8 Binary Search
 
@@ -648,14 +648,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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
-| 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, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 393 | 33.33
+| 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 10 Graph/BFS/DFS
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Array, Breadth_First_Search, Matrix | 164 | 82.95
+| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix | 164 | 82.95
 | 0417 |[Pacific Atlantic Water Flow](src/main/kotlin/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.kt)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 319 | 100.00
 
 #### Day 11 Graph/BFS/DFS
@@ -670,7 +670,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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
-| 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68
+| 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68
 
 #### Day 13 Dynamic Programming
 
@@ -693,14 +693,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 |-|-|-|-|-|-
 | 0100 |[Same Tree](src/main/kotlin/g0001_0100/s0100_same_tree/Solution.kt)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 134 | 86.63
 | 0101 |[Symmetric Tree](src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 153 | 82.35
-| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89
+| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89
 
 #### Day 16 Design
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0232 |[Implement Queue using Stacks](src/main/kotlin/g0201_0300/s0232_implement_queue_using_stacks/MyQueue.kt)| Easy | Stack, Design, Queue | 258 | 70.86
-| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88
+| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88
 | 0208 |[Implement Trie (Prefix Tree)](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 689 | 61.00
 
 #### Day 17 Interval
@@ -715,7 +715,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0735 |[Asteroid Collision](src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt)| Medium | Array, Stack | 243 | 100.00
-| 0227 |[Basic Calculator II](src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt)| Medium | Top_Interview_Questions, String, Math, Stack | 383 | 62.50
+| 0227 |[Basic Calculator II](src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt)| Medium | String, Math, Stack | 383 | 62.50
 
 #### Day 19 Union Find
 
@@ -737,7 +737,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0412 |[Fizz Buzz](src/main/kotlin/g0401_0500/s0412_fizz_buzz/Solution.kt)| Easy | Top_Interview_Questions, String, Math, Simulation | 307 | 71.81
+| 0412 |[Fizz Buzz](src/main/kotlin/g0401_0500/s0412_fizz_buzz/Solution.kt)| Easy | String, Math, Simulation | 307 | 71.81
 | 0136 |[Single Number](src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 344 | 83.63
 | 0007 |[Reverse Integer](src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt)| Medium | Top_Interview_Questions, Math | 149 | 77.89
 | 0009 |[Palindrome Number](src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt)| Easy | Math | 217 | 95.34
@@ -748,14 +748,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0344 |[Reverse String](src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 445 | 69.75
-| 0014 |[Longest Common Prefix](src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt)| Easy | Top_Interview_Questions, String | 154 | 89.70
+| 0344 |[Reverse String](src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt)| Easy | String, Two_Pointers, Recursion | 445 | 69.75
+| 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
 | 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
 | 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) | 201 | 87.28
 | 0020 |[Valid Parentheses](src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 137 | 88.76
 | 0005 |[Longest Palindromic Substring](src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 162 | 99.00
 | 0394 |[Decode String](src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 224 | 64.86
-| 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | Top_Interview_Questions, String, Hash_Table, Sorting | 251 | 87.65
+| 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | String, Hash_Table, Sorting | 251 | 87.65
 | 0049 |[Group Anagrams](src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 308 | 96.34
 | 0151 |[Reverse Words in a String](src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt)| Medium | String, Two_Pointers | 206 | 98.90
 | 0273 |[Integer to English Words](src/main/kotlin/g0201_0300/s0273_integer_to_english_words/Solution.kt)| Hard | String, Math, Recursion | 273 | 82.93
@@ -764,7 +764,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Array, Binary_Search | 261 | 77.91
+| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 261 | 77.91
 | 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
 | 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
 
@@ -773,7 +773,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0121 |[Best Time to Buy and Sell Stock](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 609 | 94.06
-| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07
+| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07
 | 0001 |[Two Sum](src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 202 | 91.18
 | 0217 |[Contains Duplicate](src/main/kotlin/g0201_0300/s0217_contains_duplicate/Solution.kt)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting | 719 | 73.49
 | 0058 |[Length of Last Word](src/main/kotlin/g0001_0100/s0058_length_of_last_word/Solution.kt)| Easy | String | 135 | 93.67
@@ -784,7 +784,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | 0055 |[Jump Game](src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 332 | 89.35
 | 0075 |[Sort Colors](src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 164 | 64.43
 | 0066 |[Plus One](src/main/kotlin/g0001_0100/s0066_plus_one/Solution.kt)| Easy | Top_Interview_Questions, Array, Math | 148 | 98.75
-| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96
+| 0238 |[Product of Array Except Self](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96
 | 1291 |[Sequential Digits](src/main/kotlin/g1201_1300/s1291_sequential_digits/Solution.kt)| Medium | Enumeration | 114 | 100.00
 | 0448 |[Find All Numbers Disappeared in an Array](src/main/kotlin/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array/Solution.kt)| Easy | Array, Hash_Table | 394 | 100.00
 | 0442 |[Find All Duplicates in an Array](src/main/kotlin/g0401_0500/s0442_find_all_duplicates_in_an_array/Solution.kt)| Medium | Array, Hash_Table | 480 | 73.81
@@ -795,7 +795,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | 1007 |[Minimum Domino Rotations For Equal Row](src/main/kotlin/g1001_1100/s1007_minimum_domino_rotations_for_equal_row/Solution.kt)| Medium | Array, Greedy | 421 | 50.00
 | 1306 |[Jump Game III](src/main/kotlin/g1301_1400/s1306_jump_game_iii/Solution.kt)| Medium | Array, Depth_First_Search, Breadth_First_Search | 291 | 100.00
 | 0456 |[132 Pattern](src/main/kotlin/g0401_0500/s0456_132_pattern/Solution.kt)| Medium | Array, Binary_Search, Stack, Ordered_Set, Monotonic_Stack | 434 | 100.00
-| 0239 |[Sliding Window Maximum](src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 1059 | 86.14
+| 0239 |[Sliding Window Maximum](src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 1059 | 86.14
 
 #### Udemy Two Pointers
 
@@ -812,7 +812,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0053 |[Maximum Subarray](src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81
+| 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
 | 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
 
 #### Udemy Sorting Algorithms
@@ -827,7 +827,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 |-|-|-|-|-|-
 | 0304 |[Range Sum Query 2D - Immutable](src/main/kotlin/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.kt)| Medium | Array, Matrix, Design, Prefix_Sum | 1373 | 85.71
 | 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_Interview_Questions, Array, Matrix, Simulation | 132 | 95.12
+| 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
 | 1572 |[Matrix Diagonal Sum](src/main/kotlin/g1501_1600/s1572_matrix_diagonal_sum/Solution.kt)| Easy | Array, Matrix | 221 | 67.61
 | 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
@@ -839,7 +839,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 |-|-|-|-|-|-
 | 0114 |[Flatten Binary Tree to Linked List](src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 191 | 93.10
 | 0445 |[Add Two Numbers II](src/main/kotlin/g0401_0500/s0445_add_two_numbers_ii/Solution.kt)| Medium | Math, Stack, Linked_List | 240 | 82.61
-| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Top_Interview_Questions, Linked_List | 216 | 86.96
+| 0328 |[Odd Even Linked List](src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt)| Medium | Linked_List | 216 | 86.96
 | 0061 |[Rotate List](src/main/kotlin/g0001_0100/s0061_rotate_list/Solution.kt)| Medium | Two_Pointers, Linked_List | 160 | 92.22
 | 0024 |[Swap Nodes in Pairs](src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 149 | 44.20
 | 0876 |[Middle of the Linked List](src/main/kotlin/g0801_0900/s0876_middle_of_the_linked_list/Solution.kt)| Easy | Two_Pointers, Linked_List | 136 | 76.52
@@ -848,7 +848,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | 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
 | 0021 |[Merge Two Sorted Lists](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 157 | 92.24
 | 0160 |[Intersection of Two Linked Lists](src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 262 | 83.50
-| 0234 |[Palindrome Linked List](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 641 | 79.53
+| 0234 |[Palindrome Linked List](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 641 | 79.53
 | 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
 | 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
 | 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
@@ -873,11 +873,11 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | 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
 | 0110 |[Balanced Binary Tree](src/main/kotlin/g0101_0200/s0110_balanced_binary_tree/Solution.kt)| Easy | Depth_First_Search, Tree, Binary_Tree | 182 | 71.30
 | 0701 |[Insert into a Binary Search Tree](src/main/kotlin/g0701_0800/s0701_insert_into_a_binary_search_tree/Solution.kt)| Medium | Tree, Binary_Tree, Binary_Search_Tree | 311 | 79.03
-| 0297 |[Serialize and Deserialize Binary Tree](src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt)| Hard | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85
+| 0297 |[Serialize and Deserialize Binary Tree](src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt)| Hard | String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85
 | 0124 |[Binary Tree Maximum Path Sum](src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 331 | 74.42
 | 0098 |[Validate Binary Search Tree](src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 190 | 61.62
 | 0337 |[House Robber III](src/main/kotlin/g0301_0400/s0337_house_robber_iii/Solution.kt)| Medium | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 282 | 84.62
-| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 386 | 45.21
 | 0968 |[Binary Tree Cameras](src/main/kotlin/g0901_1000/s0968_binary_tree_cameras/Solution.kt)| Hard | Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree | 176 | 100.00
 
 #### Udemy Trie and Heap
@@ -900,7 +900,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0120 |[Triangle](src/main/kotlin/g0101_0200/s0120_triangle/Solution.kt)| Medium | Array, Dynamic_Programming | 194 | 97.87
-| 0118 |[Pascal's Triangle](src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22
+| 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
 | 0119 |[Pascal's Triangle II](src/main/kotlin/g0101_0200/s0119_pascals_triangle_ii/Solution.kt)| Easy | Array, Dynamic_Programming | 157 | 97.27
 | 0139 |[Word Break](src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 197 | 87.17
 | 0152 |[Maximum Product Subarray](src/main/kotlin/g0101_0200/s0152_maximum_product_subarray/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 253 | 88.42
@@ -909,11 +909,11 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | 0509 |[Fibonacci Number](src/main/kotlin/g0501_0600/s0509_fibonacci_number/Solution.kt)| Easy | Dynamic_Programming, Math, Recursion, Memoization | 139 | 82.72
 | 0070 |[Climbing Stairs](src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 124 | 71.98
 | 0064 |[Minimum Path Sum](src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 164 | 100.00
-| 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28
+| 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28
 | 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36
-| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16
+| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16
 | 0044 |[Wildcard Matching](src/main/kotlin/g0001_0100/s0044_wildcard_matching/Solution.kt)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Greedy, Recursion | 220 | 84.85
-| 0010 |[Regular Expression Matching](src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 171 | 85.26
+| 0010 |[Regular Expression Matching](src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 171 | 85.26
 
 #### Udemy Backtracking/Recursion
 
@@ -935,15 +935,15 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | 0190 |[Reverse Bits](src/main/kotlin/g0101_0200/s0190_reverse_bits/Solution.kt)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 198 | 81.82
 | 0461 |[Hamming Distance](src/main/kotlin/g0401_0500/s0461_hamming_distance/Solution.kt)| Easy | Bit_Manipulation | 150 | 96.15
 | 1009 |[Complement of Base 10 Integer](src/main/kotlin/g1001_1100/s1009_complement_of_base_10_integer/Solution.kt)| Easy | Bit_Manipulation | 126 | 72.73
-| 0338 |[Counting Bits](src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt)| Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 186 | 99.26
-| 0371 |[Sum of Two Integers](src/main/kotlin/g0301_0400/s0371_sum_of_two_integers/Solution.kt)| Medium | Top_Interview_Questions, Math, Bit_Manipulation | 129 | 95.45
+| 0338 |[Counting Bits](src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt)| Easy | Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 186 | 99.26
+| 0371 |[Sum of Two Integers](src/main/kotlin/g0301_0400/s0371_sum_of_two_integers/Solution.kt)| Medium | Math, Bit_Manipulation | 129 | 95.45
 | 0029 |[Divide Two Integers](src/main/kotlin/g0001_0100/s0029_divide_two_integers/Solution.kt)| Medium | Top_Interview_Questions, Math, Bit_Manipulation | 144 | 82.50
 
 #### Udemy Design
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88
+| 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
 
@@ -952,7 +952,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81
+| 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 2 Array
 
@@ -965,7 +965,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0350 |[Intersection of Two Arrays II](src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 321 | 73.37
+| 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 4 Array
@@ -973,7 +973,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22
+| 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 5 Array
 
@@ -986,9 +986,9 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0387 |[First Unique Character in a String](src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt)| Easy | Top_Interview_Questions, String, Hash_Table, Counting, Queue | 369 | 82.68
+| 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 | Top_Interview_Questions, String, Hash_Table, Sorting | 251 | 87.65
+| 0242 |[Valid Anagram](src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt)| Easy | String, Hash_Table, Sorting | 251 | 87.65
 
 #### Day 7 Linked List
 
@@ -1048,7 +1048,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 |-|-|-|-|-|-
 | 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)| Easy | Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree | 404 | 75.59
+| 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
 
 ### Data Structure II
 
@@ -1080,15 +1080,15 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0240 |[Search a 2D Matrix II](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 460 | 66.08
+| 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 | Top_Interview_Questions, 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, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 669 | 48.96
+| 0334 |[Increasing Triplet Subsequence](src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt)| Medium | Array, Greedy | 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
@@ -1103,7 +1103,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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 | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 235 | 84.75
+| 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
 
@@ -1151,7 +1151,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0155 |[Min Stack](src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 331 | 84.88
+| 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
 
@@ -1167,7 +1167,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 194 | 92.89
+| 0199 |[Binary Tree Right Side View](src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 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
 
@@ -1175,15 +1175,15 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 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, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 393 | 33.33
+| 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, Top_Interview_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 | Top_Interview_Questions, String, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Design | 475 | 78.85
+| 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
 
@@ -1198,7 +1198,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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, Top_Interview_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n\*log(n))_Space_O(k) | 268 | 99.74
+| 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
 
@@ -1213,7 +1213,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Array, Binary_Search | 261 | 77.91
+| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 261 | 77.91
 | 0278 |[First Bad Version](src/main/kotlin/g0201_0300/s0278_first_bad_version/Solution.kt)| Easy | Binary_Search, Interactive | 349 | 76.86
 | 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
 
@@ -1228,14 +1228,14 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07
+| 0283 |[Move Zeroes](src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 516 | 79.07
 | 0167 |[Two Sum II - Input Array Is Sorted](src/main/kotlin/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.kt)| Medium | Array, Binary_Search, Two_Pointers | 403 | 68.74
 
 #### Day 4 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0344 |[Reverse String](src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt)| Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 445 | 69.75
+| 0344 |[Reverse String](src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt)| Easy | String, Two_Pointers, Recursion | 445 | 69.75
 | 0557 |[Reverse Words in a String III](src/main/kotlin/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.kt)| Easy | String, Two_Pointers | 215 | 98.10
 
 #### Day 5 Two Pointers
@@ -1250,7 +1250,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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) | 201 | 87.28
-| 0567 |[Permutation in String](src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt)| Medium | String, Hash_Table, Two_Pointers, Sliding_Window | 169 | 100.00
+| 0567 |[Permutation in String](src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt)| Medium | Top_100_Liked_Questions, String, Hash_Table, Two_Pointers, Sliding_Window | 169 | 100.00
 
 #### Day 7 Breadth First Search Depth First Search
 
@@ -1271,7 +1271,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0542 |[01 Matrix](src/main/kotlin/g0501_0600/s0542_01_matrix/Solution.kt)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 441 | 94.06
-| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Array, Breadth_First_Search, Matrix | 164 | 82.95
+| 0994 |[Rotting Oranges](src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Breadth_First_Search, Matrix | 164 | 82.95
 
 #### Day 10 Recursion Backtracking
 
@@ -1427,7 +1427,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28
+| 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
 | 0673 |[Number of Longest Increasing Subsequence](src/main/kotlin/g0601_0700/s0673_number_of_longest_increasing_subsequence/Solution.kt)| Medium | Array, Dynamic_Programming, Segment_Tree, Binary_Indexed_Tree | 226 | 91.67
 
 #### Day 17 Dynamic Programming
@@ -1441,8 +1441,8 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16
-| 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68
+| 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
+| 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68
 | 0343 |[Integer Break](src/main/kotlin/g0301_0400/s0343_integer_break/Solution.kt)| Medium | Dynamic_Programming, Math | 218 | 63.89
 
 #### Day 19 Bit Manipulation
@@ -1455,7 +1455,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0384 |[Shuffle an Array](src/main/kotlin/g0301_0400/s0384_shuffle_an_array/Solution.kt)| Medium | Top_Interview_Questions, Array, Math, Randomized | 940 | 72.09
+| 0384 |[Shuffle an Array](src/main/kotlin/g0301_0400/s0384_shuffle_an_array/Solution.kt)| Medium | Array, Math, Randomized | 940 | 72.09
 
 #### Day 21 Others
 
@@ -1470,7 +1470,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Array, Binary_Search | 261 | 77.91
+| 0704 |[Binary Search](src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 261 | 77.91
 | 0374 |[Guess Number Higher or Lower](src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt)| Easy | Binary_Search, Interactive | 134 | 94.19
 
 #### Day 2
@@ -1478,7 +1478,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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
-| 0852 |[Peak Index in a Mountain Array](src/main/kotlin/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.kt)| Easy | Array, Binary_Search | 433 | 94.29
+| 0852 |[Peak Index in a Mountain Array](src/main/kotlin/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.kt)| Medium | Array, Binary_Search | 433 | 94.29
 
 #### Day 3
 
@@ -1533,7 +1533,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0350 |[Intersection of Two Arrays II](src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt)| Easy | Top_Interview_Questions, Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 321 | 73.37
+| 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
 | 0633 |[Sum of Square Numbers](src/main/kotlin/g0601_0700/s0633_sum_of_square_numbers/Solution.kt)| Medium | Math, Binary_Search, Two_Pointers | 126 | 100.00
 
 #### Day 11
@@ -1569,7 +1569,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28
+| 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
 | 1760 |[Minimum Limit of Balls in a Bag](src/main/kotlin/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag/Solution.kt)| Medium | Array, Binary_Search | 460 | 100.00
 
 #### Day 4
@@ -1583,7 +1583,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0287 |[Find the Duplicate Number](src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 656 | 66.21
+| 0287 |[Find the Duplicate Number](src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 656 | 66.21
 | 1283 |[Find the Smallest Divisor Given a Threshold](src/main/kotlin/g1201_1300/s1283_find_the_smallest_divisor_given_a_threshold/Solution.kt)| Medium | Array, Binary_Search | 255 | 100.00
 
 #### Day 6
@@ -1604,7 +1604,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0240 |[Search a 2D Matrix II](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 460 | 66.08
+| 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
 | 0275 |[H-Index II](src/main/kotlin/g0201_0300/s0275_h_index_ii/Solution.kt)| Medium | Array, Binary_Search | 398 | 81.82
 
 #### Day 9
@@ -1726,7 +1726,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0053 |[Maximum Subarray](src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81
+| 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
 | 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 6
@@ -1770,13 +1770,13 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0264 |[Ugly Number II](src/main/kotlin/g0201_0300/s0264_ugly_number_ii/Solution.kt)| Medium | Hash_Table, Dynamic_Programming, Math, Heap_Priority_Queue | 182 | 95.45
-| 0096 |[Unique Binary Search Trees](src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt)| Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 116 | 92.31
+| 0096 |[Unique Binary Search Trees](src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 116 | 92.31
 
 #### Day 12
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0118 |[Pascal's Triangle](src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt)| Easy | Top_Interview_Questions, Array, Dynamic_Programming | 277 | 33.22
+| 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
 | 0119 |[Pascal's Triangle II](src/main/kotlin/g0101_0200/s0119_pascals_triangle_ii/Solution.kt)| Easy | Array, Dynamic_Programming | 157 | 97.27
 
 #### Day 13
@@ -1805,7 +1805,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 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
-| 0221 |[Maximal Square](src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 614 | 44.00
+| 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 17
 
@@ -1818,7 +1818,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0300 |[Longest Increasing Subsequence](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 318 | 82.28
+| 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
 | 0376 |[Wiggle Subsequence](src/main/kotlin/g0301_0400/s0376_wiggle_subsequence/Solution.kt)| Medium | Array, Dynamic_Programming, Greedy | 162 | 88.89
 
 #### Day 19
@@ -1827,13 +1827,13 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 |-|-|-|-|-|-
 | 0392 |[Is Subsequence](src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt)| Easy | String, Dynamic_Programming, Two_Pointers | 156 | 87.74
 | 1143 |[Longest Common Subsequence](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 307 | 38.36
-| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16
+| 0072 |[Edit Distance](src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 182 | 92.16
 
 #### Day 20
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0322 |[Coin Change](src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 332 | 50.68
+| 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
 | 0518 |[Coin Change II](src/main/kotlin/g0501_0600/s0518_coin_change_2/Solution.kt)| Medium | Array, Dynamic_Programming | 139 | 100.00
 
 #### Day 21
@@ -1842,7 +1842,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.22'
 |-|-|-|-|-|-
 | 0377 |[Combination Sum IV](src/main/kotlin/g0301_0400/s0377_combination_sum_iv/Solution.kt)| Medium | Array, Dynamic_Programming | 217 | 72.41
 | 0343 |[Integer Break](src/main/kotlin/g0301_0400/s0343_integer_break/Solution.kt)| Medium | Dynamic_Programming, Math | 218 | 63.89
-| 0279 |[Perfect Squares](src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt)| Medium | Top_Interview_Questions, Dynamic_Programming, Math, Breadth_First_Search | 176 | 98.80
+| 0279 |[Perfect Squares](src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt)| Medium | Dynamic_Programming, Math, Breadth_First_Search | 176 | 98.80
 
 ## Contributing
 Your ideas/fixes/algorithms are more than welcome!
diff --git a/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt b/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
index ffc017e36..cb7a3edf1 100644
--- a/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt
@@ -1,8 +1,7 @@
 package g0001_0100.s0010_regular_expression_matching
 
-// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
-// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
-// #2023_07_03_Time_171_ms_(85.26%)_Space_34.6_MB_(94.74%)
+// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
+// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_07_03_Time_171_ms_(85.26%)_Space_34.6_MB_(94.74%)
 
 class Solution {
     fun isMatch(s: String, p: String): Boolean {
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 6c7a38f01..a7bbd60b4 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,6 +1,6 @@
 package g0001_0100.s0013_roman_to_integer
 
-// #Easy #Top_Interview_Questions #String #Hash_Table #Math
+// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
 // #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%)
 
 class Solution {
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 a2f98720e..e974276f3 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,7 @@
 package g0001_0100.s0014_longest_common_prefix
 
-// #Easy #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%)
+// #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%)
 
 class Solution {
     fun longestCommonPrefix(strs: Array<String>): String {
diff --git a/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt b/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt
index 394df1def..4a3257b1f 100644
--- a/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt
@@ -1,6 +1,6 @@
 package g0001_0100.s0053_maximum_subarray
 
-// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 // #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
 // #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
 // #2023_07_10_Time_510_ms_(78.81%)_Space_54.7_MB_(69.00%)
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 f0b5646dc..dbb3e7dde 100644
--- a/src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0054_spiral_matrix/Solution.kt
@@ -1,7 +1,7 @@
 package g0001_0100.s0054_spiral_matrix
 
-// #Medium #Top_Interview_Questions #Array #Matrix #Simulation #Programming_Skills_II_Day_8
-// #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Simulation
+// #Programming_Skills_II_Day_8 #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
 // #2023_07_10_Time_132_ms_(95.12%)_Space_33.5_MB_(93.17%)
 
 class Solution {
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 6e3f25b32..7d842d877 100644
--- a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt
@@ -1,6 +1,6 @@
 package g0001_0100.s0072_edit_distance
 
-// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
+// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
 // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
 // #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
 // #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%)
diff --git a/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt b/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt
index 8b2b447b8..852e0a6e7 100644
--- a/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt
+++ b/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt
@@ -1,7 +1,7 @@
 package g0001_0100.s0096_unique_binary_search_trees
 
-// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree
-// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
+// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
+// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
 // #2023_07_10_Time_116_ms_(92.31%)_Space_32.6_MB_(84.62%)
 
 class Solution {
diff --git a/src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt b/src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt
index 3daea4f30..3691f459c 100644
--- a/src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0118_pascals_triangle/Solution.kt
@@ -1,7 +1,7 @@
 package g0101_0200.s0118_pascals_triangle
 
-// #Easy #Top_Interview_Questions #Array #Dynamic_Programming #Data_Structure_I_Day_4_Array
-// #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming
+// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
+// #Data_Structure_I_Day_4_Array #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming
 // #2022_10_08_Time_277_ms_(33.22%)_Space_34.2_MB_(90.60%)
 
 class Solution {
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 a5e0e6d6e..7a04758c1 100644
--- a/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt
+++ b/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt
@@ -1,6 +1,6 @@
 package g0101_0200.s0155_min_stack
 
-// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design
+// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design
 // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design
 // #Udemy_Design #Big_O_Time_O(1)_Space_O(N)
 // #2022_09_06_Time_331_ms_(84.88%)_Space_54.3_MB_(46.34%)
diff --git a/src/main/kotlin/g0101_0200/s0164_maximum_gap/Solution.kt b/src/main/kotlin/g0101_0200/s0164_maximum_gap/Solution.kt
index e511957b0..db5942f3f 100644
--- a/src/main/kotlin/g0101_0200/s0164_maximum_gap/Solution.kt
+++ b/src/main/kotlin/g0101_0200/s0164_maximum_gap/Solution.kt
@@ -1,6 +1,6 @@
 package g0101_0200.s0164_maximum_gap
 
-// #Hard #Array #Sorting #Bucket_Sort #Radix_Sort
+// #Medium #Array #Sorting #Bucket_Sort #Radix_Sort
 // #2022_10_11_Time_991_ms_(68.00%)_Space_77.2_MB_(88.00%)
 
 class Solution {
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 9dc8b8782..7bd605cb2 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,6 +1,6 @@
 package g0101_0200.s0199_binary_tree_right_side_view
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
+// #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
 // #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree
 // #2022_09_09_Time_194_ms_(92.89%)_Space_35.4_MB_(67.89%)
 
diff --git a/src/main/kotlin/g0201_0300/s0218_the_skyline_problem/Solution.kt b/src/main/kotlin/g0201_0300/s0218_the_skyline_problem/Solution.kt
index 34b06c13a..fdb7ca297 100644
--- a/src/main/kotlin/g0201_0300/s0218_the_skyline_problem/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0218_the_skyline_problem/Solution.kt
@@ -1,8 +1,7 @@
 package g0201_0300.s0218_the_skyline_problem
 
-// #Hard #Top_Interview_Questions #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer
-// #Segment_Tree #Binary_Indexed_Tree #Line_Sweep
-// #2022_10_25_Time_365_ms_(93.14%)_Space_45.7_MB_(93.71%)
+// #Hard #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer #Segment_Tree
+// #Binary_Indexed_Tree #Line_Sweep #2022_10_25_Time_365_ms_(93.14%)_Space_45.7_MB_(93.71%)
 
 import java.util.TreeMap
 
diff --git a/src/main/kotlin/g0201_0300/s0220_contains_duplicate_iii/Solution.kt b/src/main/kotlin/g0201_0300/s0220_contains_duplicate_iii/Solution.kt
index 2007cba61..5cf88c1b0 100644
--- a/src/main/kotlin/g0201_0300/s0220_contains_duplicate_iii/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0220_contains_duplicate_iii/Solution.kt
@@ -1,6 +1,6 @@
 package g0201_0300.s0220_contains_duplicate_iii
 
-// #Medium #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort
+// #Hard #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort
 // #2022_10_25_Time_921_ms_(72.22%)_Space_77.4_MB_(41.67%)
 
 class Solution {
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 651c7ccc5..08393a667 100644
--- a/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt
@@ -1,8 +1,7 @@
 package g0201_0300.s0221_maximal_square
 
-// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
-// #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n)
-// #2022_09_10_Time_614_ms_(44.00%)_Space_76.2_MB_(65.33%)
+// #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%)
 
 class Solution {
     fun maximalSquare(matrix: Array<CharArray>): Int {
diff --git a/src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt b/src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt
index 150cfc00b..27e00d159 100644
--- a/src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0227_basic_calculator_ii/Solution.kt
@@ -1,6 +1,6 @@
 package g0201_0300.s0227_basic_calculator_ii
 
-// #Medium #Top_Interview_Questions #String #Math #Stack #Level_2_Day_18_Stack
+// #Medium #String #Math #Stack #Level_2_Day_18_Stack
 // #2022_10_26_Time_383_ms_(62.50%)_Space_39.5_MB_(83.33%)
 
 class Solution {
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 a74cda32a..c0385d14b 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,8 +1,8 @@
 package g0201_0300.s0230_kth_smallest_element_in_a_bst
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
-// #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree
-// #Big_O_Time_O(n)_Space_O(n) #2022_09_10_Time_393_ms_(33.33%)_Space_41.8_MB_(66.67%)
+// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
+// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
+// #2022_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/s0234_palindrome_linked_list/Solution.kt b/src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt
index dd2346248..cfac91f76 100644
--- a/src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt
@@ -1,7 +1,7 @@
 package g0201_0300.s0234_palindrome_linked_list
 
-// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List
-// #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
+// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion
+// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
 // #2022_09_18_Time_641_ms_(79.53%)_Space_80.9_MB_(58.23%)
 
 import com_github_leetcode.ListNode
diff --git a/src/main/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.kt
index 1b11d8972..7990ffdd6 100644
--- a/src/main/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree/Solution.kt
@@ -1,6 +1,6 @@
 package g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree
 
-// #Easy #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree
+// #Medium #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree
 // #Level_1_Day_8_Binary_Search_Tree #2022_10_26_Time_404_ms_(75.59%)_Space_46.1_MB_(78.74%)
 
 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 1450ae9bc..816087b83 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,6 +1,6 @@
 package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
+// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
 // #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
 // #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%)
 
diff --git a/src/main/kotlin/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.kt b/src/main/kotlin/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.kt
index 9396af9fb..1942616a9 100644
--- a/src/main/kotlin/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0237_delete_node_in_a_linked_list/Solution.kt
@@ -1,6 +1,6 @@
 package g0201_0300.s0237_delete_node_in_a_linked_list
 
-// #Easy #Top_Interview_Questions #Linked_List #2022_10_27_Time_183_ms_(93.00%)_Space_35_MB_(95.19%)
+// #Medium #Linked_List #2022_10_27_Time_183_ms_(93.00%)_Space_35_MB_(95.19%)
 
 import com_github_leetcode.ListNode
 
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 d66598c5b..0d00667fc 100644
--- a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt
@@ -1,8 +1,7 @@
 package g0201_0300.s0238_product_of_array_except_self
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum
-// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n)
-// #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%)
+// #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%)
 
 class Solution {
     fun productExceptSelf(nums: IntArray): IntArray {
diff --git a/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt b/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt
index 710b73fb1..444a3f74f 100644
--- a/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt
@@ -1,7 +1,7 @@
 package g0201_0300.s0239_sliding_window_maximum
 
-// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue
-// #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
+// #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue
+// #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
 // #2022_09_10_Time_1059_ms_(86.14%)_Space_113.7_MB_(65.35%)
 
 import java.util.LinkedList
diff --git a/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt b/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt
index 8c429d7cd..abcbfa4a6 100644
--- a/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt
@@ -1,8 +1,8 @@
 package g0201_0300.s0240_search_a_2d_matrix_ii
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Matrix
-// #Divide_and_Conquer #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8
-// #Big_O_Time_O(n+m)_Space_O(1) #2022_09_10_Time_460_ms_(66.08%)_Space_55.9_MB_(65.19%)
+// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer
+// #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
+// #2022_09_10_Time_460_ms_(66.08%)_Space_55.9_MB_(65.19%)
 
 class Solution {
     fun searchMatrix(matrix: Array<IntArray>, target: Int): Boolean {
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 87cf0b646..c494626e6 100644
--- a/src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0242_valid_anagram/Solution.kt
@@ -1,6 +1,6 @@
 package g0201_0300.s0242_valid_anagram
 
-// #Easy #Top_Interview_Questions #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String
+// #Easy #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String
 // #Programming_Skills_I_Day_11_Containers_and_Libraries #Udemy_Strings
 // #2022_10_27_Time_251_ms_(87.65%)_Space_39.1_MB_(69.49%)
 
diff --git a/src/main/kotlin/g0201_0300/s0268_missing_number/Solution.kt b/src/main/kotlin/g0201_0300/s0268_missing_number/Solution.kt
index 4604a4757..2ef039786 100644
--- a/src/main/kotlin/g0201_0300/s0268_missing_number/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0268_missing_number/Solution.kt
@@ -1,6 +1,6 @@
 package g0201_0300.s0268_missing_number
 
-// #Easy #Top_Interview_Questions #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation
+// #Easy #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation
 // #2022_11_03_Time_380_ms_(83.49%)_Space_48.6_MB_(76.76%)
 
 class Solution {
diff --git a/src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt b/src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt
index 7c0d1e86c..b0dccb88b 100644
--- a/src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt
@@ -1,7 +1,7 @@
 package g0201_0300.s0279_perfect_squares
 
-// #Medium #Top_Interview_Questions #Dynamic_Programming #Math #Breadth_First_Search
-// #Dynamic_Programming_I_Day_21 #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)
+// #Medium #Dynamic_Programming #Math #Breadth_First_Search #Dynamic_Programming_I_Day_21
+// #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)
 
 @Suppress("NAME_SHADOWING")
 class Solution {
diff --git a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt
index cfd950253..5f6344c0c 100644
--- a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt
@@ -1,8 +1,8 @@
 package g0201_0300.s0283_move_zeroes
 
-// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers
-// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
-// #Big_O_Time_O(n)_Space_O(1) #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%)
+// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
+// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
+// #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%)
 
 class Solution {
     fun moveZeroes(nums: IntArray) {
diff --git a/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt b/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt
index 847624f55..45d569873 100644
--- a/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt
+++ b/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt
@@ -1,7 +1,7 @@
 package g0201_0300.s0287_find_the_duplicate_number
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers
-// #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
+// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
+// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
 // #2022_09_10_Time_656_ms_(66.21%)_Space_78.6_MB_(66.89%)
 
 class Solution {
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 3ac14e378..49352ee2e 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,7 +1,6 @@
 package g0201_0300.s0289_game_of_life
 
-// #Medium #Top_Interview_Questions #Array #Matrix #Simulation
-// #2022_11_04_Time_174_ms_(96.97%)_Space_34.2_MB_(93.94%)
+// #Medium #Array #Matrix #Simulation #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/s0295_find_median_from_data_stream/MedianFinder.kt b/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt
index fe1c1ef89..9027e2d72 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,8 +1,7 @@
 package g0201_0300.s0295_find_median_from_data_stream
 
-// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design
-// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n)
-// #2022_09_11_Time_2289_ms_(33.60%)_Space_153.3_MB_(5.74%)
+// #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%)
 
 import java.util.PriorityQueue
 
diff --git a/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt b/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt
index 77b87fe4b..5f6181dee 100644
--- a/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt
+++ b/src/main/kotlin/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.kt
@@ -1,7 +1,7 @@
 package g0201_0300.s0297_serialize_and_deserialize_binary_tree
 
-// #Hard #Top_Interview_Questions #String #Depth_First_Search #Breadth_First_Search #Tree
-// #Binary_Tree #Design #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
+// #Hard #String #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Design
+// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
 // #2022_11_06_Time_475_ms_(78.85%)_Space_50.3_MB_(64.42%)
 
 import com_github_leetcode.TreeNode
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 76223dbd1..75385e9aa 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
@@ -1,8 +1,8 @@
 package g0201_0300.s0300_longest_increasing_subsequence
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
-// #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3
-// #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
+// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
+// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
+// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
 // #2022_09_11_Time_318_ms_(82.28%)_Space_39.2_MB_(82.77%)
 
 class Solution {
diff --git a/src/main/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.kt b/src/main/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.kt
index 4aec89112..6c1e44999 100644
--- a/src/main/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0315_count_of_smaller_numbers_after_self/Solution.kt
@@ -1,8 +1,7 @@
 package g0301_0400.s0315_count_of_smaller_numbers_after_self
 
-// #Hard #Top_Interview_Questions #Array #Binary_Search #Ordered_Set #Divide_and_Conquer
-// #Segment_Tree #Binary_Indexed_Tree #Merge_Sort
-// #2022_11_10_Time_1282_ms_(88.46%)_Space_109.8_MB_(46.15%)
+// #Hard #Array #Binary_Search #Ordered_Set #Divide_and_Conquer #Segment_Tree #Binary_Indexed_Tree
+// #Merge_Sort #2022_11_10_Time_1282_ms_(88.46%)_Space_109.8_MB_(46.15%)
 
 import java.util.LinkedList
 
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 d6d08c84f..3e066356e 100644
--- a/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt
@@ -1,7 +1,7 @@
 package g0301_0400.s0322_coin_change
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
-// #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
+// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
+// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
 // #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount)
 // #2022_09_11_Time_332_ms_(50.68%)_Space_37.6_MB_(79.93%)
 
diff --git a/src/main/kotlin/g0301_0400/s0324_wiggle_sort_ii/Solution.kt b/src/main/kotlin/g0301_0400/s0324_wiggle_sort_ii/Solution.kt
index ed8ed5e7e..4fc6c6728 100644
--- a/src/main/kotlin/g0301_0400/s0324_wiggle_sort_ii/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0324_wiggle_sort_ii/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0324_wiggle_sort_ii
 
-// #Medium #Top_Interview_Questions #Array #Sorting #Divide_and_Conquer #Quickselect
+// #Medium #Array #Sorting #Divide_and_Conquer #Quickselect
 // #2022_11_12_Time_545_ms_(57.14%)_Space_57.1_MB_(57.14%)
 
 class Solution {
diff --git a/src/main/kotlin/g0301_0400/s0326_power_of_three/Solution.kt b/src/main/kotlin/g0301_0400/s0326_power_of_three/Solution.kt
index 7b3e70bfc..1afedef0b 100644
--- a/src/main/kotlin/g0301_0400/s0326_power_of_three/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0326_power_of_three/Solution.kt
@@ -1,7 +1,6 @@
 package g0301_0400.s0326_power_of_three
 
-// #Easy #Top_Interview_Questions #Math #Recursion
-// #2022_11_12_Time_413_ms_(76.12%)_Space_40.4_MB_(47.76%)
+// #Easy #Math #Recursion #2022_11_12_Time_413_ms_(76.12%)_Space_40.4_MB_(47.76%)
 
 class Solution {
     fun isPowerOfThree(n: Int): Boolean {
diff --git a/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt b/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt
index 43e6d1f32..a60287292 100644
--- a/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0328_odd_even_linked_list
 
-// #Medium #Top_Interview_Questions #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
+// #Medium #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
 // #2022_11_12_Time_216_ms_(86.96%)_Space_36.7_MB_(85.22%)
 
 import com_github_leetcode.ListNode
diff --git a/src/main/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.kt b/src/main/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.kt
index c86227386..fcb9b2ab3 100644
--- a/src/main/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0329_longest_increasing_path_in_a_matrix/Solution.kt
@@ -1,7 +1,7 @@
 package g0301_0400.s0329_longest_increasing_path_in_a_matrix
 
-// #Hard #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search #Breadth_First_Search
-// #Graph #Memoization #Topological_Sort #2022_11_12_Time_322_ms_(92.65%)_Space_39.2_MB_(100.00%)
+// #Hard #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Graph #Memoization
+// #Topological_Sort #2022_11_12_Time_322_ms_(92.65%)_Space_39.2_MB_(100.00%)
 
 class Solution {
     fun longestIncreasingPath(matrix: Array<IntArray>): Int {
diff --git a/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt b/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt
index 170b1fae5..476c99121 100644
--- a/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0334_increasing_triplet_subsequence
 
-// #Medium #Top_Interview_Questions #Array #Greedy #Data_Structure_II_Day_5_Array
+// #Medium #Array #Greedy #Data_Structure_II_Day_5_Array
 // #2022_11_15_Time_672_ms_(60.61%)_Space_128.6_MB_(5.23%)
 
 class Solution {
diff --git a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt
index 7d56712f4..1af442503 100644
--- a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0338_counting_bits
 
-// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
+// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
 // #Big_O_Time_O(num)_Space_O(num) #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%)
 
 class Solution {
diff --git a/src/main/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.kt b/src/main/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.kt
index f75cde0b7..4c504f948 100644
--- a/src/main/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.kt
+++ b/src/main/kotlin/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.kt
@@ -1,7 +1,7 @@
 package g0301_0400.s0341_flatten_nested_list_iterator
 
-// #Medium #Top_Interview_Questions #Depth_First_Search #Tree #Stack #Design #Queue #Iterator
-// #Programming_Skills_II_Day_18 #2022_11_25_Time_210_ms_(100.00%)_Space_37.6_MB_(100.00%)
+// #Medium #Depth_First_Search #Tree #Stack #Design #Queue #Iterator #Programming_Skills_II_Day_18
+// #2022_11_25_Time_210_ms_(100.00%)_Space_37.6_MB_(100.00%)
 
 import com_github_leetcode.NestedInteger
 
diff --git a/src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt b/src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt
index a6fc4e02c..1cf3db3c4 100644
--- a/src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0344_reverse_string/Solution.kt
@@ -1,7 +1,7 @@
 package g0301_0400.s0344_reverse_string
 
-// #Easy #Top_Interview_Questions #String #Two_Pointers #Recursion #Algorithm_I_Day_4_Two_Pointers
-// #Udemy_Strings #2022_11_18_Time_445_ms_(69.75%)_Space_61.9_MB_(33.77%)
+// #Easy #String #Two_Pointers #Recursion #Algorithm_I_Day_4_Two_Pointers #Udemy_Strings
+// #2022_11_18_Time_445_ms_(69.75%)_Space_61.9_MB_(33.77%)
 
 class Solution {
     fun reverseString(s: CharArray) {
diff --git a/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt b/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt
index 998d61331..640748faf 100644
--- a/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt
@@ -1,9 +1,8 @@
 package g0301_0400.s0347_top_k_frequent_elements
 
-// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting
-// #Heap_Priority_Queue #Counting #Divide_and_Conquer #Quickselect #Bucket_Sort
-// #Data_Structure_II_Day_20_Heap_Priority_Queue #Big_O_Time_O(n*log(n))_Space_O(k)
-// #2022_09_11_Time_268_ms_(99.74%)_Space_42_MB_(87.93%)
+// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting
+// #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
+// #Big_O_Time_O(n*log(n))_Space_O(k) #2022_09_11_Time_268_ms_(99.74%)_Space_42_MB_(87.93%)
 
 import java.util.PriorityQueue
 import java.util.Queue
diff --git a/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt b/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt
index 54fbdff81..bc18a1b5d 100644
--- a/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.kt
@@ -1,8 +1,7 @@
 package g0301_0400.s0350_intersection_of_two_arrays_ii
 
-// #Easy #Top_Interview_Questions #Array #Hash_Table #Sorting #Binary_Search #Two_Pointers
-// #Data_Structure_I_Day_3_Array #Binary_Search_I_Day_10
-// #2022_11_18_Time_321_ms_(73.37%)_Space_38.4_MB_(62.81%)
+// #Easy #Array #Hash_Table #Sorting #Binary_Search #Two_Pointers #Data_Structure_I_Day_3_Array
+// #Binary_Search_I_Day_10 #2022_11_18_Time_321_ms_(73.37%)_Space_38.4_MB_(62.81%)
 
 class Solution {
     fun intersect(nums1: IntArray, nums2: IntArray): IntArray {
diff --git a/src/main/kotlin/g0301_0400/s0371_sum_of_two_integers/Solution.kt b/src/main/kotlin/g0301_0400/s0371_sum_of_two_integers/Solution.kt
index b06a213ec..2b0a363fb 100644
--- a/src/main/kotlin/g0301_0400/s0371_sum_of_two_integers/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0371_sum_of_two_integers/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0371_sum_of_two_integers
 
-// #Medium #Top_Interview_Questions #Math #Bit_Manipulation #Udemy_Bit_Manipulation
+// #Medium #Math #Bit_Manipulation #Udemy_Bit_Manipulation
 // #2022_11_22_Time_129_ms_(95.45%)_Space_32.9_MB_(90.91%)
 
 @Suppress("NAME_SHADOWING")
diff --git a/src/main/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.kt b/src/main/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.kt
index 9e8dfc5d5..b5b50ca52 100644
--- a/src/main/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix
 
-// #Medium #Top_Interview_Questions #Array #Sorting #Binary_Search #Matrix #Heap_Priority_Queue
+// #Medium #Array #Sorting #Binary_Search #Matrix #Heap_Priority_Queue
 // #2022_09_11_Time_522_ms_(59.78%)_Space_56.6_MB_(79.61%)
 
 class Solution {
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 e9d7f4124..8651c0ad5 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 #Top_Interview_Questions #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%)
+// #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%)
 
 import kotlin.random.Random
 
diff --git a/src/main/kotlin/g0301_0400/s0384_shuffle_an_array/Solution.kt b/src/main/kotlin/g0301_0400/s0384_shuffle_an_array/Solution.kt
index 84b010158..f0fea0ae3 100644
--- a/src/main/kotlin/g0301_0400/s0384_shuffle_an_array/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0384_shuffle_an_array/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0384_shuffle_an_array
 
-// #Medium #Top_Interview_Questions #Array #Math #Randomized #Algorithm_II_Day_20_Others
+// #Medium #Array #Math #Randomized #Algorithm_II_Day_20_Others
 // #2022_11_24_Time_940_ms_(72.09%)_Space_81.5_MB_(51.16%)
 
 import kotlin.random.Random
diff --git a/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt b/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt
index 8ddff207f..814e567c6 100644
--- a/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0387_first_unique_character_in_a_string/Solution.kt
@@ -1,7 +1,7 @@
 package g0301_0400.s0387_first_unique_character_in_a_string
 
-// #Easy #Top_Interview_Questions #String #Hash_Table #Counting #Queue
-// #Data_Structure_I_Day_6_String #2022_11_24_Time_369_ms_(82.68%)_Space_53.6_MB_(66.43%)
+// #Easy #String #Hash_Table #Counting #Queue #Data_Structure_I_Day_6_String
+// #2022_11_24_Time_369_ms_(82.68%)_Space_53.6_MB_(66.43%)
 
 class Solution {
     fun firstUniqChar(s: String): Int {
diff --git a/src/main/kotlin/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.kt b/src/main/kotlin/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.kt
index db138b4fa..ec322035a 100644
--- a/src/main/kotlin/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.kt
+++ b/src/main/kotlin/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters/Solution.kt
@@ -1,6 +1,6 @@
 package g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters
 
-// #Medium #Top_Interview_Questions #String #Hash_Table #Sliding_Window #Divide_and_Conquer
+// #Medium #String #Hash_Table #Sliding_Window #Divide_and_Conquer
 // #2022_11_28_Time_274_ms_(66.67%)_Space_34_MB_(100.00%)
 
 class Solution {
diff --git a/src/main/kotlin/g0401_0500/s0412_fizz_buzz/Solution.kt b/src/main/kotlin/g0401_0500/s0412_fizz_buzz/Solution.kt
index d9fed571f..a08e0f632 100644
--- a/src/main/kotlin/g0401_0500/s0412_fizz_buzz/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0412_fizz_buzz/Solution.kt
@@ -1,6 +1,6 @@
 package g0401_0500.s0412_fizz_buzz
 
-// #Easy #Top_Interview_Questions #String #Math #Simulation #Udemy_Integers
+// #Easy #String #Math #Simulation #Udemy_Integers
 // #2022_12_03_Time_307_ms_(71.81%)_Space_41.9_MB_(71.97%)
 
 class Solution {
diff --git a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt
index a4bdc7cee..18a471b39 100644
--- a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt
@@ -1,7 +1,7 @@
 package g0401_0500.s0437_path_sum_iii
 
-// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
-// #Big_O_Time_O(n)_Space_O(n) #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%)
+// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
+// #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%)
 
 import com_github_leetcode.TreeNode
 
diff --git a/src/main/kotlin/g0401_0500/s0454_4sum_ii/Solution.kt b/src/main/kotlin/g0401_0500/s0454_4sum_ii/Solution.kt
index 6b96140e8..784890156 100644
--- a/src/main/kotlin/g0401_0500/s0454_4sum_ii/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0454_4sum_ii/Solution.kt
@@ -1,7 +1,6 @@
 package g0401_0500.s0454_4sum_ii
 
-// #Medium #Top_Interview_Questions #Array #Hash_Table
-// #2022_12_26_Time_660_ms_(85.71%)_Space_48.4_MB_(82.86%)
+// #Medium #Array #Hash_Table #2022_12_26_Time_660_ms_(85.71%)_Space_48.4_MB_(82.86%)
 
 class Solution {
     fun fourSumCount(nums1: IntArray, nums2: IntArray, nums3: IntArray, nums4: IntArray): Int {
diff --git a/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt b/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt
index 159c156c9..acfd4202a 100644
--- a/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt
+++ b/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt
@@ -1,7 +1,6 @@
 package g0401_0500.s0494_target_sum
 
-// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking
-// #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
+// #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
 // #2022_09_16_Time_308_ms_(89.61%)_Space_37.2_MB_(61.04%)
 
 @Suppress("NAME_SHADOWING")
diff --git a/src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt b/src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt
index e1e1ecbbf..31a9b2b38 100644
--- a/src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt
+++ b/src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt
@@ -1,7 +1,7 @@
 package g0501_0600.s0567_permutation_in_string
 
-// #Medium #String #Hash_Table #Two_Pointers #Sliding_Window #Algorithm_I_Day_6_Sliding_Window
-// #2023_01_23_Time_169_ms_(100.00%)_Space_35.6_MB_(85.86%)
+// #Medium #Top_100_Liked_Questions #String #Hash_Table #Two_Pointers #Sliding_Window
+// #Algorithm_I_Day_6_Sliding_Window #2023_01_23_Time_169_ms_(100.00%)_Space_35.6_MB_(85.86%)
 
 class Solution {
     fun checkInclusion(s1: String, s2: String): Boolean {
diff --git a/src/main/kotlin/g0601_0700/s0606_construct_string_from_binary_tree/Solution.kt b/src/main/kotlin/g0601_0700/s0606_construct_string_from_binary_tree/Solution.kt
index 34f8deb5f..00744974f 100644
--- a/src/main/kotlin/g0601_0700/s0606_construct_string_from_binary_tree/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0606_construct_string_from_binary_tree/Solution.kt
@@ -1,6 +1,6 @@
 package g0601_0700.s0606_construct_string_from_binary_tree
 
-// #Easy #String #Depth_First_Search #Tree #Binary_Tree
+// #Medium #String #Depth_First_Search #Tree #Binary_Tree
 // #2023_02_03_Time_187_ms_(100.00%)_Space_38.8_MB_(90.91%)
 
 import com_github_leetcode.TreeNode
diff --git a/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt b/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt
index 85e60b8ff..b952abfb5 100644
--- a/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt
+++ b/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt
@@ -1,6 +1,6 @@
 package g0601_0700.s0647_palindromic_substrings
 
-// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n)
+// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n)
 // #2022_09_11_Time_266_ms_(67.83%)_Space_34_MB_(93.91%)
 
 class Solution {
diff --git a/src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt b/src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt
index 800374d94..de87c3a22 100644
--- a/src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt
@@ -1,7 +1,7 @@
 package g0701_0800.s0704_binary_search
 
-// #Easy #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search #Binary_Search_I_Day_1
-// #Level_1_Day_7_Binary_Search #Udemy_Binary_Search
+// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
+// #Binary_Search_I_Day_1 #Level_1_Day_7_Binary_Search #Udemy_Binary_Search
 // #2023_02_23_Time_261_ms_(77.91%)_Space_38.7_MB_(34.19%)
 
 class Solution {
diff --git a/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt b/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt
index 02137f7ee..c4f9e9589 100644
--- a/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt
+++ b/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt
@@ -1,8 +1,7 @@
 package g0701_0800.s0763_partition_labels
 
-// #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers
-// #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1)
-// #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%)
+// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
+// #Big_O_Time_O(n)_Space_O(1) #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%)
 
 class Solution {
     fun partitionLabels(s: String): List<Int> {
diff --git a/src/main/kotlin/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.kt b/src/main/kotlin/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.kt
index c2f35678b..4e33d5865 100644
--- a/src/main/kotlin/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.kt
+++ b/src/main/kotlin/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.kt
@@ -1,6 +1,6 @@
 package g0801_0900.s0852_peak_index_in_a_mountain_array
 
-// #Easy #Array #Binary_Search #Binary_Search_I_Day_2
+// #Medium #Array #Binary_Search #Binary_Search_I_Day_2
 // #2023_03_30_Time_433_ms_(94.29%)_Space_49.4_MB_(100.00%)
 
 class Solution {
diff --git a/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt b/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt
index 8ef5c58fc..5cca16c3a 100644
--- a/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0937_reorder_data_in_log_files/Solution.kt
@@ -1,6 +1,6 @@
 package g0901_1000.s0937_reorder_data_in_log_files
 
-// #Easy #Array #String #Sorting #2023_04_28_Time_205_ms_(81.82%)_Space_44_MB_(9.09%)
+// #Medium #Array #String #Sorting #2023_04_28_Time_205_ms_(81.82%)_Space_44_MB_(9.09%)
 
 import java.util.Collections
 
diff --git a/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt b/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt
index b442f5914..9cf7c4585 100644
--- a/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt
+++ b/src/main/kotlin/g0901_1000/s0994_rotting_oranges/Solution.kt
@@ -1,6 +1,6 @@
 package g0901_1000.s0994_rotting_oranges
 
-// #Medium #Array #Breadth_First_Search #Matrix
+// #Medium #Top_100_Liked_Questions #Array #Breadth_First_Search #Matrix
 // #Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search #Level_2_Day_10_Graph/BFS/DFS
 // #2023_05_22_Time_164_ms_(82.95%)_Space_36.2_MB_(49.61%)
 
diff --git a/src/main/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.kt b/src/main/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.kt
index 8d7135587..ba498c2c7 100644
--- a/src/main/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.kt
+++ b/src/main/kotlin/g1401_1500/s1441_build_an_array_with_stack_operations/Solution.kt
@@ -1,6 +1,6 @@
 package g1401_1500.s1441_build_an_array_with_stack_operations
 
-// #Easy #Array #Stack #Simulation #2023_06_07_Time_160_ms_(100.00%)_Space_35.4_MB_(100.00%)
+// #Medium #Array #Stack #Simulation #2023_06_07_Time_160_ms_(100.00%)_Space_35.4_MB_(100.00%)
 
 class Solution {
     fun buildArray(target: IntArray, n: Int): List<String> {
diff --git a/src/main/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.kt b/src/main/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.kt
index 4b4c93723..ec2950acf 100644
--- a/src/main/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.kt
+++ b/src/main/kotlin/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points/Solution.kt
@@ -1,6 +1,6 @@
 package g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points
 
-// #Medium #Array #Sorting #2023_06_17_Time_616_ms_(100.00%)_Space_80.5_MB_(100.00%)
+// #Easy #Array #Sorting #2023_06_17_Time_616_ms_(100.00%)_Space_80.5_MB_(100.00%)
 
 class Solution {
     fun maxWidthOfVerticalArea(points: Array<IntArray>): Int {
diff --git a/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt b/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt
index 14b82d5c6..3440a85b7 100644
--- a/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt
+++ b/src/main/kotlin/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations/Solution.kt
@@ -1,6 +1,6 @@
 package g1701_1800.s1770_maximum_score_from_performing_multiplication_operations
 
-// #Medium #Array #Dynamic_Programming #2023_06_18_Time_436_ms_(91.67%)_Space_51.6_MB_(79.17%)
+// #Hard #Array #Dynamic_Programming #2023_06_18_Time_436_ms_(91.67%)_Space_51.6_MB_(79.17%)
 
 class Solution {
     fun maximumScore(nums: IntArray, multipliers: IntArray): Int {
diff --git a/src/main/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.kt b/src/main/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.kt
index 66fdb4f9e..cff313072 100644
--- a/src/main/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.kt
+++ b/src/main/kotlin/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i/Solution.kt
@@ -1,6 +1,6 @@
 package g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i
 
-// #Medium #Array #String #Dynamic_Programming #Greedy
+// #Easy #Array #String #Dynamic_Programming #Greedy
 // #2023_12_21_Time_294_ms_(100.00%)_Space_46.3_MB_(100.00%)
 
 class Solution {