From d240317564359769235a61f25f49ff9f8b5a8564 Mon Sep 17 00:00:00 2001
From: Valentyn Kolesnikov <javadev75@gmail.com>
Date: Sun, 15 Jun 2025 07:53:32 +0300
Subject: [PATCH] Updated readme and tags

---
 README.md                                     | 1159 ++++++++++-------
 .../ruby/g0001_0100/s0001_two_sum/solution.rb |    3 +-
 .../s0002_add_two_numbers/solution.rb         |    4 +-
 .../solution.rb                               |    3 +-
 .../solution.rb                               |    3 +-
 .../solution.rb                               |    4 +-
 .../s0006_zigzag_conversion/solution.rb       |    3 +-
 .../s0009_palindrome_number/solution.rb       |    3 +-
 .../solution.rb                               |    5 +-
 .../solution.rb                               |    4 +-
 .../ruby/g0001_0100/s0015_3sum/solution.rb    |    3 +-
 .../solution.rb                               |    5 +-
 .../solution.rb                               |    4 +-
 .../s0020_valid_parentheses/solution.rb       |    4 +-
 .../s0021_merge_two_sorted_lists/solution.rb  |    4 +-
 .../s0022_generate_parentheses/solution.rb    |    3 +-
 .../s0023_merge_k_sorted_lists/solution.rb    |    3 +-
 .../solution.rb                               |    2 +-
 .../solution.rb                               |    2 +-
 .../solution.rb                               |    4 +-
 .../s0035_search_insert_position/solution.rb  |    2 +-
 .../s0039_combination_sum/solution.rb         |    3 +-
 .../s0042_trapping_rain_water/solution.rb     |    3 +-
 .../g0001_0100/s0045_jump_game_ii/solution.rb |    3 +-
 .../g0001_0100/s0046_permutations/solution.rb |    2 +-
 .../g0001_0100/s0048_rotate_image/solution.rb |    3 +-
 .../s0049_group_anagrams/solution.rb          |    3 +-
 .../s0053_maximum_subarray/solution.rb        |    4 +-
 .../g0001_0100/s0055_jump_game/solution.rb    |    3 +-
 .../s0056_merge_intervals/solution.rb         |    3 +-
 .../g0001_0100/s0062_unique_paths/solution.rb |    6 +-
 .../s0064_minimum_path_sum/solution.rb        |    4 +-
 .../s0070_climbing_stairs/solution.rb         |    4 +-
 .../s0072_edit_distance/solution.rb           |    4 +-
 .../s0073_set_matrix_zeroes/solution.rb       |    2 +-
 .../s0074_search_a_2d_matrix/solution.rb      |    2 +-
 .../solution.rb                               |    4 +-
 .../g0001_0100/s0079_word_search/solution.rb  |    4 +-
 .../solution.rb                               |    4 +-
 .../solution.rb                               |    2 +-
 .../s0101_symmetric_tree/solution.rb          |    3 +-
 .../solution.rb                               |    3 +-
 .../solution.rb                               |    5 +-
 .../solution.rb                               |    4 +-
 .../solution.rb                               |    2 +-
 .../solution.rb                               |    3 +-
 .../solution.rb                               |    4 +-
 .../solution.rb                               |    3 +-
 .../s0136_single_number/solution.rb           |    3 +-
 .../solution.rb                               |    4 +-
 .../g0101_0200/s0139_word_break/solution.rb   |    4 +-
 .../s0141_linked_list_cycle/solution.rb       |    4 +-
 .../g0101_0200/s0146_lru_cache/lrucache.rb    |    4 +-
 .../g0101_0200/s0148_sort_list/solution.rb    |    4 +-
 .../solution.rb                               |    4 +-
 .../g0101_0200/s0155_min_stack/minstack.rb    |    5 +-
 .../s0169_majority_element/solution.rb        |    3 +-
 .../g0101_0200/s0189_rotate_array/solution.rb |    4 +-
 .../g0101_0200/s0198_house_robber/solution.rb |    6 +-
 .../s0200_number_of_islands/solution.rb       |    3 +-
 .../s0206_reverse_linked_list/solution.rb     |    6 +-
 .../s0207_course_schedule/solution.rb         |    4 +-
 .../s0208_implement_trie_prefix_tree/trie.rb  |    2 +-
 .../solution.rb                               |    3 +-
 .../s0221_maximal_square/solution.rb          |    4 +-
 .../s0226_invert_binary_tree/solution.rb      |    3 +-
 .../solution.rb                               |    7 +-
 .../s0234_palindrome_linked_list/solution.rb  |    4 +-
 .../solution.rb                               |    5 +-
 .../solution.rb                               |    6 +-
 .../s0239_sliding_window_maximum/solution.rb  |    4 +-
 .../s0240_search_a_2d_matrix_ii/solution.rb   |    6 +-
 .../g0201_0300/s0283_move_zeroes/solution.rb  |    2 +-
 .../solution.rb                               |    4 +-
 .../medianfinder.rb                           |    4 +-
 .../solution.rb                               |    6 +-
 .../g0301_0400/s0322_coin_change/solution.rb  |    6 +-
 .../s0338_counting_bits/solution.rb           |    5 +-
 .../s0347_top_k_frequent_elements/solution.rb |    7 +-
 .../s0394_decode_string/solution.rb           |    5 +-
 .../g0401_0500/s0437_path_sum_iii/solution.rb |    2 +-
 .../g0401_0500/s0494_target_sum/solution.rb   |    3 +-
 .../s0647_palindromic_substrings/solution.rb  |    2 +-
 .../s0739_daily_temperatures/solution.rb      |    5 +-
 .../s0763_partition_labels/solution.rb        |    5 +-
 .../solution.rb                               |    2 +-
 86 files changed, 845 insertions(+), 632 deletions(-)

diff --git a/README.md b/README.md
index 27ee34a..df8242f 100644
--- a/README.md
+++ b/README.md
@@ -11,20 +11,319 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 > ["For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."](https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews)
 
 ##
+* [Dynamic Programming I](#dynamic-programming-i)
+* [Programming Skills I](#programming-skills-i)
+* [Programming Skills II](#programming-skills-ii)
 * [Graph Theory I](#graph-theory-i)
 * [SQL I](#sql-i)
 * [Level 1](#level-1)
 * [Level 2](#level-2)
 * [Udemy](#udemy)
+* [Top Interview 150](#top-interview-150)
 * [Data Structure I](#data-structure-i)
 * [Data Structure II](#data-structure-ii)
 * [Algorithm I](#algorithm-i)
 * [Algorithm II](#algorithm-ii)
 * [Binary Search I](#binary-search-i)
 * [Binary Search II](#binary-search-ii)
-* [Dynamic Programming I](#dynamic-programming-i)
-* [Programming Skills I](#programming-skills-i)
-* [Programming Skills II](#programming-skills-ii)
+
+### Dynamic Programming I
+
+#### Day 1
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 2
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0070 |[Climbing Stairs](src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 48 | 96.01
+
+#### Day 3
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
+
+#### Day 4
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
+| 0045 |[Jump Game II](src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 68 | 75.23
+
+#### Day 5
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
+
+#### Day 6
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0152 |[Maximum Product Subarray](src/main/ruby/g0101_0200/s0152_maximum_product_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 63 | 80.30
+
+#### Day 7
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0121 |[Best Time to Buy and Sell Stock](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 147 | 80.21
+
+#### Day 8
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 9
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| 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) | 64 | 79.31
+| 0042 |[Trapping Rain Water](src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 69 | 80.74
+
+#### Day 10
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 11
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0096 |[Unique Binary Search Trees](src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 57 | 61.54
+
+#### Day 12
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 13
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 14
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 15
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
+
+#### Day 16
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0064 |[Minimum Path Sum](src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 78 | 52.50
+| 0221 |[Maximal Square](src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 184 | 80.00
+
+#### Day 17
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
+
+#### Day 18
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
+
+#### Day 19
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
+| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
+
+#### Day 20
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
+
+#### Day 21
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+### Programming Skills I
+
+#### Day 1 Basic Data Type
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 2 Operator
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 3 Conditional Statements
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 4 Loop
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 5 Function
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 6 Array
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 95 | 78.01
+
+#### Day 7 Array
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 8 String
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 9 String
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 10 Linked List and Tree
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 55 | 96.72
+
+#### Day 11 Containers and Libraries
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 12 Class and Object
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+### Programming Skills II
+
+#### Day 1
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 2
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 3
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 4
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 5
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 6
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0739 |[Daily Temperatures](src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 490 | 84.71
+
+#### Day 7
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0048 |[Rotate Image](src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 50 | 93.64
+
+#### Day 8
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 9
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 10
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 11
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0049 |[Group Anagrams](src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 154 | 83.69
+
+#### Day 12
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0438 |[Find All Anagrams in a String](src/main/ruby/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 186 | 82.72
+
+#### Day 13
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 14
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0138 |[Copy List with Random Pointer](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 65 | 69.84
+
+#### Day 15
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0002 |[Add Two Numbers](src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 68 | 97.48
+
+#### Day 16
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 17
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 18
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
+
+#### Day 19
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
+
+#### Day 20
+
+| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
+|-|-|-|-|-|-
 
 ### Graph Theory I
 
@@ -168,7 +467,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
-| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
+| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
 
 #### Day 4 Linked List
 
@@ -215,7 +514,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
+| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
 
 #### Day 12 Sliding Window/Two Pointer
 
@@ -227,13 +526,13 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 57 | 89.38
+| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 57 | 89.38
 
 #### Day 14 Stack
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0394 |[Decode String](src/main/ruby/g0301_0400/s0394_decode_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 58 | 84.09
+| 0394 |[Decode String](src/main/ruby/g0301_0400/s0394_decode_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 58 | 84.09
 
 #### Day 15 Heap
 
@@ -257,7 +556,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0019 |[Remove Nth Node From End of List](src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 51 | 95.27
-| 0234 |[Palindrome Linked List](src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 297 | 78.26
+| 0234 |[Palindrome Linked List](src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 297 | 78.26
 
 #### Day 4 Linked List
 
@@ -281,7 +580,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0543 |[Diameter of Binary Tree](src/main/ruby/g0501_0600/s0543_diameter_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 64 | 86.54
-| 0437 |[Path Sum III](src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 205 | 61.54
+| 0437 |[Path Sum III](src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 205 | 61.54
 
 #### Day 8 Binary Search
 
@@ -294,7 +593,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0230 |[Kth Smallest Element in a BST](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb)| 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) | 68 | 89.41
+| 0230 |[Kth Smallest Element in a BST](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 68 | 89.41
 
 #### Day 10 Graph/BFS/DFS
 
@@ -310,8 +609,8 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
-| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
+| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
+| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
 
 #### Day 13 Dynamic Programming
 
@@ -324,7 +623,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 94 | 85.62
+| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 94 | 85.62
 | 0076 |[Minimum Window Substring](src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 175 | 93.33
 
 #### Day 15 Tree
@@ -337,8 +636,8 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
-| 0208 |[Implement Trie (Prefix Tree)](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb)| 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) | 167 | 69.81
+| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
+| 0208 |[Implement Trie (Prefix Tree)](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 167 | 69.81
 
 #### Day 17 Interval
 
@@ -369,7 +668,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
+| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
 | 0007 |[Reverse Integer](src/main/ruby/g0001_0100/s0007_reverse_integer/solution.rb)| Medium | Top_Interview_Questions, Math | 58 | 75.27
 | 0009 |[Palindrome Number](src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb)| Easy | Math | 83 | 74.19
 
@@ -377,10 +676,10 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 94 | 85.62
+| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 94 | 85.62
 | 0020 |[Valid Parentheses](src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 53 | 90.52
 | 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
-| 0394 |[Decode String](src/main/ruby/g0301_0400/s0394_decode_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 58 | 84.09
+| 0394 |[Decode String](src/main/ruby/g0301_0400/s0394_decode_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 58 | 84.09
 | 0049 |[Group Anagrams](src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 154 | 83.69
 
 #### Udemy Binary Search
@@ -395,14 +694,14 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0121 |[Best Time to Buy and Sell Stock](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 147 | 80.21
-| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 95 | 78.01
-| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 57 | 89.38
+| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 95 | 78.01
+| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 57 | 89.38
 | 0189 |[Rotate Array](src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 100 | 92.40
 | 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
 | 0075 |[Sort Colors](src/main/ruby/g0001_0100/s0075_sort_colors/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 54 | 88.46
-| 0238 |[Product of Array Except Self](src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 123 | 76.59
+| 0238 |[Product of Array Except Self](src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 123 | 76.59
 | 0041 |[First Missing Positive](src/main/ruby/g0001_0100/s0041_first_missing_positive/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 130 | 65.63
-| 0239 |[Sliding Window Maximum](src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb)| 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) | 511 | 77.78
+| 0239 |[Sliding Window Maximum](src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 511 | 77.78
 
 #### Udemy Two Pointers
 
@@ -415,7 +714,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
+| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
 | 0169 |[Majority Element](src/main/ruby/g0101_0200/s0169_majority_element/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 75 | 64.60
 
 #### Udemy Sorting Algorithms
@@ -440,10 +739,10 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 | 0024 |[Swap Nodes in Pairs](src/main/ruby/g0001_0100/s0024_swap_nodes_in_pairs/solution.rb)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 59 | 76.00
 | 0142 |[Linked List Cycle II](src/main/ruby/g0101_0200/s0142_linked_list_cycle_ii/solution.rb)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 62 | 93.94
 | 0141 |[Linked List Cycle](src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 97.65
-| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
+| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
 | 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
 | 0160 |[Intersection of Two Linked Lists](src/main/ruby/g0101_0200/s0160_intersection_of_two_linked_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 108 | 75.86
-| 0234 |[Palindrome Linked List](src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 297 | 78.26
+| 0234 |[Palindrome Linked List](src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 297 | 78.26
 | 0138 |[Copy List with Random Pointer](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 65 | 69.84
 | 0025 |[Reverse Nodes in k-Group](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 62 | 91.67
 | 0146 |[LRU Cache](src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 290 | 78.05
@@ -456,16 +755,16 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 | 0102 |[Binary Tree Level Order Traversal](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 66 | 76.43
 | 0543 |[Diameter of Binary Tree](src/main/ruby/g0501_0600/s0543_diameter_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 64 | 86.54
 | 0226 |[Invert Binary Tree](src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 54 | 89.43
-| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| 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) | 55 | 96.72
+| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 55 | 96.72
 | 0124 |[Binary Tree Maximum Path Sum](src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 71 | 98.00
 | 0098 |[Validate Binary Search Tree](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb)| 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)) | 68 | 70.23
-| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 75 | 86.57
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 75 | 86.57
 
 #### Udemy Trie and Heap
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0208 |[Implement Trie (Prefix Tree)](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb)| 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) | 167 | 69.81
+| 0208 |[Implement Trie (Prefix Tree)](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 167 | 69.81
 
 #### Udemy Graph
 
@@ -479,13 +778,13 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 |-|-|-|-|-|-
 | 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| 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) | 64 | 79.31
 | 0152 |[Maximum Product Subarray](src/main/ruby/g0101_0200/s0152_maximum_product_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 63 | 80.30
-| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
+| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
 | 0070 |[Climbing Stairs](src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 48 | 96.01
 | 0064 |[Minimum Path Sum](src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 78 | 52.50
-| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
-| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
-| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
-| 0010 |[Regular Expression Matching](src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 66 | 94.44
+| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
+| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
+| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
+| 0010 |[Regular Expression Matching](src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 66 | 94.44
 
 #### Udemy Backtracking/Recursion
 
@@ -494,811 +793,701 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 | 0022 |[Generate Parentheses](src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 43 | 100.00
 | 0039 |[Combination Sum](src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 79 | 74.84
 | 0078 |[Subsets](src/main/ruby/g0001_0100/s0078_subsets/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 63 | 70.43
-| 0017 |[Letter Combinations of a Phone Number](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 49 | 93.94
+| 0017 |[Letter Combinations of a Phone Number](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 49 | 93.94
 | 0046 |[Permutations](src/main/ruby/g0001_0100/s0046_permutations/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 62 | 89.60
 
 #### Udemy Bit Manipulation
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0338 |[Counting Bits](src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb)| Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 90 | 96.34
+| 0338 |[Counting Bits](src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 90 | 96.34
 
 #### Udemy Design
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
-
-### Data Structure I
-
-#### Day 1 Array
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
-
-#### Day 2 Array
+| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
 
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 57 | 89.38
+### Top Interview 150
 
-#### Day 3 Array
+#### Top Interview 150 Array/String
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0169 |[Majority Element](src/main/ruby/g0101_0200/s0169_majority_element/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 75 | 64.60
+| 0189 |[Rotate Array](src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 100 | 92.40
 | 0121 |[Best Time to Buy and Sell Stock](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 147 | 80.21
+| 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
+| 0045 |[Jump Game II](src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 68 | 75.23
+| 0238 |[Product of Array Except Self](src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 123 | 76.59
+| 0042 |[Trapping Rain Water](src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 69 | 80.74
+| 0006 |[Zigzag Conversion](src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb)| Medium | String | 77 | 100.00
 
-#### Day 4 Array
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-
-#### Day 5 Array
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
-
-#### Day 6 String
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-
-#### Day 7 Linked List
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0141 |[Linked List Cycle](src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 97.65
-| 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
-
-#### Day 8 Linked List
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
-
-#### Day 9 Stack Queue
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0020 |[Valid Parentheses](src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 53 | 90.52
-
-#### Day 10 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0094 |[Binary Tree Inorder Traversal](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 56 | 84.00
-
-#### Day 11 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0102 |[Binary Tree Level Order Traversal](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 66 | 76.43
-| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| 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) | 55 | 96.72
-| 0101 |[Symmetric Tree](src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb)| 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)) | 58 | 91.34
-
-#### Day 12 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0226 |[Invert Binary Tree](src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 54 | 89.43
-
-#### Day 13 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-
-#### Day 14 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0098 |[Validate Binary Search Tree](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb)| 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)) | 68 | 70.23
-
-### Data Structure II
-
-#### Day 1 Array
+#### Top Interview 150 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
-| 0169 |[Majority Element](src/main/ruby/g0101_0200/s0169_majority_element/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 75 | 64.60
+| 0011 |[Container With Most Water](src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 114 | 95.98
 | 0015 |[3Sum](src/main/ruby/g0001_0100/s0015_3sum/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 659 | 83.74
 
-#### Day 2 Array
+#### Top Interview 150 Sliding Window
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0075 |[Sort Colors](src/main/ruby/g0001_0100/s0075_sort_colors/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 54 | 88.46
-| 0056 |[Merge Intervals](src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 103 | 74.70
+| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 94 | 85.62
+| 0076 |[Minimum Window Substring](src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 175 | 93.33
 
-#### Day 3 Array
+#### Top Interview 150 Matrix
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0048 |[Rotate Image](src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 50 | 93.64
+| 0073 |[Set Matrix Zeroes](src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Big_O_Time_O(m\*n)_Space_O(1) | 59 | 100.00
 
-#### Day 4 Array
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0240 |[Search a 2D Matrix II](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 154 | 100.00
-
-#### Day 5 Array
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0238 |[Product of Array Except Self](src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 123 | 76.59
-| 0560 |[Subarray Sum Equals K](src/main/ruby/g0501_0600/s0560_subarray_sum_equals_k/solution.rb)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 112 | 51.61
-
-#### Day 6 String
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-
-#### Day 7 String
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0763 |[Partition Labels](src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb)| Medium | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 62 | 100.00
-
-#### Day 8 String
+#### Top Interview 150 Hashmap
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0049 |[Group Anagrams](src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 154 | 83.69
+| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 57 | 89.38
+| 0128 |[Longest Consecutive Sequence](src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Big_O_Time_O(N_log_N)_Space_O(1) | 135 | 91.36
 
-#### Day 9 String
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
-
-#### Day 10 Linked List
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0002 |[Add Two Numbers](src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)) | 68 | 97.48
-| 0142 |[Linked List Cycle II](src/main/ruby/g0101_0200/s0142_linked_list_cycle_ii/solution.rb)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 62 | 93.94
-
-#### Day 11 Linked List
+#### Top Interview 150 Intervals
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0160 |[Intersection of Two Linked Lists](src/main/ruby/g0101_0200/s0160_intersection_of_two_linked_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 108 | 75.86
+| 0056 |[Merge Intervals](src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 103 | 74.70
 
-#### Day 12 Linked List
+#### Top Interview 150 Stack
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0024 |[Swap Nodes in Pairs](src/main/ruby/g0001_0100/s0024_swap_nodes_in_pairs/solution.rb)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 59 | 76.00
+| 0020 |[Valid Parentheses](src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 53 | 90.52
+| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
 
-#### Day 13 Linked List
+#### Top Interview 150 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0141 |[Linked List Cycle](src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 97.65
+| 0002 |[Add Two Numbers](src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 68 | 97.48
+| 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
+| 0138 |[Copy List with Random Pointer](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 65 | 69.84
 | 0025 |[Reverse Nodes in k-Group](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 62 | 91.67
+| 0019 |[Remove Nth Node From End of List](src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 51 | 95.27
+| 0146 |[LRU Cache](src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 290 | 78.05
 
-#### Day 14 Stack Queue
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
-
-#### Day 15 Tree
+#### Top Interview 150 Binary Tree General
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 55 | 96.72
+| 0226 |[Invert Binary Tree](src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 54 | 89.43
+| 0101 |[Symmetric Tree](src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb)| 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)) | 58 | 91.34
 | 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 71 | 91.78
+| 0114 |[Flatten Binary Tree to Linked List](src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 47 | 100.00
+| 0124 |[Binary Tree Maximum Path Sum](src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 71 | 98.00
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 75 | 86.57
 
-#### Day 16 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-
-#### Day 17 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0230 |[Kth Smallest Element in a BST](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb)| 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) | 68 | 89.41
-
-#### Day 18 Tree
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 75 | 86.57
-
-#### Day 19 Graph
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-
-#### Day 20 Heap Priority Queue
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0215 |[Kth Largest Element in an Array](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb)| 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)) | 123 | 93.55
-| 0347 |[Top K Frequent Elements](src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb)| 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) | 67 | 83.85
-
-#### Day 21 Heap Priority Queue
+#### Top Interview 150 Binary Tree BFS
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0102 |[Binary Tree Level Order Traversal](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 66 | 76.43
 
-### Algorithm I
-
-#### Day 1 Binary Search
+#### Top Interview 150 Binary Search Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0035 |[Search Insert Position](src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 48 | 97.37
+| 0230 |[Kth Smallest Element in a BST](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 68 | 89.41
+| 0098 |[Validate Binary Search Tree](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb)| 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)) | 68 | 70.23
 
-#### Day 2 Two Pointers
+#### Top Interview 150 Graph General
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0189 |[Rotate Array](src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 100 | 92.40
+| 0200 |[Number of Islands](src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 141 | 72.68
+| 0207 |[Course Schedule](src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N) | 60 | 95.42
 
-#### Day 3 Two Pointers
+#### Top Interview 150 Graph BFS
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 95 | 78.01
 
-#### Day 4 Two Pointers
+#### Top Interview 150 Trie
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0208 |[Implement Trie (Prefix Tree)](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 167 | 69.81
 
-#### Day 5 Two Pointers
+#### Top Interview 150 Backtracking
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0019 |[Remove Nth Node From End of List](src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 51 | 95.27
+| 0017 |[Letter Combinations of a Phone Number](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 49 | 93.94
+| 0046 |[Permutations](src/main/ruby/g0001_0100/s0046_permutations/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 62 | 89.60
+| 0039 |[Combination Sum](src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 79 | 74.84
+| 0022 |[Generate Parentheses](src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 43 | 100.00
+| 0079 |[Word Search](src/main/ruby/g0001_0100/s0079_word_search/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 56 | 100.00
 
-#### Day 6 Sliding Window
+#### Top Interview 150 Divide and Conquer
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 94 | 85.62
+| 0148 |[Sort List](src/main/ruby/g0101_0200/s0148_sort_list/solution.rb)| 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)) | 188 | 84.21
+| 0023 |[Merge k Sorted Lists](src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(k\*n\*log(k))_Space_O(log(k)) | 76 | 87.95
 
-#### Day 7 Breadth First Search Depth First Search
+#### Top Interview 150 Kadane's Algorithm
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
 
-#### Day 8 Breadth First Search Depth First Search
+#### Top Interview 150 Binary Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0035 |[Search Insert Position](src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 48 | 97.37
+| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
+| 0033 |[Search in Rotated Sorted Array](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 59 | 74.85
+| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 60 | 77.52
+| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
+| 0004 |[Median of Two Sorted Arrays](src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task | 64 | 93.81
 
-#### Day 9 Breadth First Search Depth First Search
+#### Top Interview 150 Heap
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0215 |[Kth Largest Element in an Array](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 123 | 93.55
+| 0295 |[Find Median from Data Stream](src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 314 | 95.00
 
-#### Day 10 Recursion Backtracking
+#### Top Interview 150 Bit Manipulation
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
-| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
+| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
 
-#### Day 11 Recursion Backtracking
+#### Top Interview 150 Math
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0046 |[Permutations](src/main/ruby/g0001_0100/s0046_permutations/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 62 | 89.60
+| 0009 |[Palindrome Number](src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb)| Easy | Math | 83 | 74.19
 
-#### Day 12 Dynamic Programming
+#### Top Interview 150 1D DP
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 | 0070 |[Climbing Stairs](src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 48 | 96.01
-| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
-
-#### Day 13 Bit Manipulation
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-
-#### Day 14 Bit Manipulation
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
-
-### Algorithm II
-
-#### Day 1 Binary Search
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 60 | 77.52
-| 0033 |[Search in Rotated Sorted Array](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 59 | 74.85
-| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
-
-#### Day 2 Binary Search
-
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
+| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
+| 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| 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) | 64 | 79.31
+| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
+| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
 
-#### Day 3 Two Pointers
+#### Top Interview 150 Multidimensional DP
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0015 |[3Sum](src/main/ruby/g0001_0100/s0015_3sum/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 659 | 83.74
-
-#### Day 4 Two Pointers
+| 0064 |[Minimum Path Sum](src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 78 | 52.50
+| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
+| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
+| 0221 |[Maximal Square](src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 184 | 80.00
 
-| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
-|-|-|-|-|-|-
-| 0011 |[Container With Most Water](src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 114 | 95.98
+### Data Structure I
 
-#### Day 5 Sliding Window
+#### Day 1 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0438 |[Find All Anagrams in a String](src/main/ruby/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 186 | 82.72
+| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
 
-#### Day 6 Breadth First Search Depth First Search
+#### Day 2 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0200 |[Number of Islands](src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 141 | 72.68
+| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 57 | 89.38
 
-#### Day 7 Breadth First Search Depth First Search
+#### Day 3 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0121 |[Best Time to Buy and Sell Stock](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 147 | 80.21
 
-#### Day 8 Breadth First Search Depth First Search
+#### Day 4 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 9 Recursion Backtracking
+#### Day 5 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0078 |[Subsets](src/main/ruby/g0001_0100/s0078_subsets/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 63 | 70.43
+| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
 
-#### Day 10 Recursion Backtracking
+#### Day 6 String
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0039 |[Combination Sum](src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 79 | 74.84
 
-#### Day 11 Recursion Backtracking
+#### Day 7 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0017 |[Letter Combinations of a Phone Number](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 49 | 93.94
-| 0022 |[Generate Parentheses](src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 43 | 100.00
-| 0079 |[Word Search](src/main/ruby/g0001_0100/s0079_word_search/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 56 | 100.00
+| 0141 |[Linked List Cycle](src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 97.65
+| 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
 
-#### Day 12 Dynamic Programming
+#### Day 8 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
+| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
 
-#### Day 13 Dynamic Programming
+#### Day 9 Stack Queue
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0045 |[Jump Game II](src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 68 | 75.23
-| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
+| 0020 |[Valid Parentheses](src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 53 | 90.52
 
-#### Day 14 Dynamic Programming
+#### Day 10 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
+| 0094 |[Binary Tree Inorder Traversal](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 56 | 84.00
 
-#### Day 15 Dynamic Programming
+#### Day 11 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| 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) | 64 | 79.31
+| 0102 |[Binary Tree Level Order Traversal](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 66 | 76.43
+| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 55 | 96.72
+| 0101 |[Symmetric Tree](src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb)| 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)) | 58 | 91.34
 
-#### Day 16 Dynamic Programming
+#### Day 12 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
+| 0226 |[Invert Binary Tree](src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 54 | 89.43
 
-#### Day 17 Dynamic Programming
+#### Day 13 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
 
-#### Day 18 Dynamic Programming
+#### Day 14 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
-| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
+| 0098 |[Validate Binary Search Tree](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb)| 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)) | 68 | 70.23
 
-#### Day 19 Bit Manipulation
+### Data Structure II
+
+#### Day 1 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
+| 0169 |[Majority Element](src/main/ruby/g0101_0200/s0169_majority_element/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 75 | 64.60
+| 0015 |[3Sum](src/main/ruby/g0001_0100/s0015_3sum/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 659 | 83.74
 
-#### Day 20 Others
+#### Day 2 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0075 |[Sort Colors](src/main/ruby/g0001_0100/s0075_sort_colors/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 54 | 88.46
+| 0056 |[Merge Intervals](src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 103 | 74.70
 
-#### Day 21 Others
+#### Day 3 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0048 |[Rotate Image](src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 50 | 93.64
 
-### Binary Search I
-
-#### Day 1
+#### Day 4 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0240 |[Search a 2D Matrix II](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 154 | 100.00
 
-#### Day 2
+#### Day 5 Array
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0035 |[Search Insert Position](src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 48 | 97.37
+| 0238 |[Product of Array Except Self](src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 123 | 76.59
+| 0560 |[Subarray Sum Equals K](src/main/ruby/g0501_0600/s0560_subarray_sum_equals_k/solution.rb)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 112 | 51.61
 
-#### Day 3
+#### Day 6 String
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 4
+#### Day 7 String
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0763 |[Partition Labels](src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb)| Medium | String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 62 | 100.00
 
-#### Day 5
+#### Day 8 String
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 60 | 77.52
+| 0049 |[Group Anagrams](src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 154 | 83.69
 
-#### Day 6
+#### Day 9 String
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
 
-#### Day 7
+#### Day 10 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0002 |[Add Two Numbers](src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 68 | 97.48
+| 0142 |[Linked List Cycle II](src/main/ruby/g0101_0200/s0142_linked_list_cycle_ii/solution.rb)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 62 | 93.94
 
-#### Day 8
+#### Day 11 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
+| 0160 |[Intersection of Two Linked Lists](src/main/ruby/g0101_0200/s0160_intersection_of_two_linked_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 108 | 75.86
 
-#### Day 9
+#### Day 12 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0024 |[Swap Nodes in Pairs](src/main/ruby/g0001_0100/s0024_swap_nodes_in_pairs/solution.rb)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 59 | 76.00
 
-#### Day 10
+#### Day 13 Linked List
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0025 |[Reverse Nodes in k-Group](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 62 | 91.67
 
-#### Day 11
+#### Day 14 Stack Queue
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0033 |[Search in Rotated Sorted Array](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 59 | 74.85
+| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
 
-#### Day 12
+#### Day 15 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
-
-### Binary Search II
+| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 71 | 91.78
 
-#### Day 1
+#### Day 16 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 2
+#### Day 17 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0230 |[Kth Smallest Element in a BST](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 68 | 89.41
 
-#### Day 3
+#### Day 18 Tree
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 75 | 86.57
 
-#### Day 4
+#### Day 19 Graph
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 5
+#### Day 20 Heap Priority Queue
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0287 |[Find the Duplicate Number](src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 107 | 81.25
+| 0215 |[Kth Largest Element in an Array](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 123 | 93.55
+| 0347 |[Top K Frequent Elements](src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb)| 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) | 67 | 83.85
 
-#### Day 6
+#### Day 21 Heap Priority Queue
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 7
+### Algorithm I
+
+#### Day 1 Binary Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0035 |[Search Insert Position](src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 48 | 97.37
 
-#### Day 8
+#### Day 2 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0240 |[Search a 2D Matrix II](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 154 | 100.00
+| 0189 |[Rotate Array](src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 100 | 92.40
 
-#### Day 9
+#### Day 3 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 95 | 78.01
 
-#### Day 10
+#### Day 4 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 11
+#### Day 5 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0019 |[Remove Nth Node From End of List](src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 51 | 95.27
 
-#### Day 12
+#### Day 6 Sliding Window
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 94 | 85.62
 
-#### Day 13
+#### Day 7 Breadth First Search Depth First Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 14
+#### Day 8 Breadth First Search Depth First Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 15
+#### Day 9 Breadth First Search Depth First Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 16
+#### Day 10 Recursion Backtracking
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
+| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
 
-#### Day 17
+#### Day 11 Recursion Backtracking
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0046 |[Permutations](src/main/ruby/g0001_0100/s0046_permutations/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 62 | 89.60
 
-#### Day 18
+#### Day 12 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0070 |[Climbing Stairs](src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 48 | 96.01
+| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
 
-#### Day 19
+#### Day 13 Bit Manipulation
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 20
+#### Day 14 Bit Manipulation
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
 
-### Dynamic Programming I
+### Algorithm II
 
-#### Day 1
+#### Day 1 Binary Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 60 | 77.52
+| 0033 |[Search in Rotated Sorted Array](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 59 | 74.85
+| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
 
-#### Day 2
+#### Day 2 Binary Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0070 |[Climbing Stairs](src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 48 | 96.01
+| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
 
-#### Day 3
+#### Day 3 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
+| 0015 |[3Sum](src/main/ruby/g0001_0100/s0015_3sum/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 659 | 83.74
 
-#### Day 4
+#### Day 4 Two Pointers
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
-| 0045 |[Jump Game II](src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 68 | 75.23
+| 0011 |[Container With Most Water](src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 114 | 95.98
 
-#### Day 5
+#### Day 5 Sliding Window
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
+| 0438 |[Find All Anagrams in a String](src/main/ruby/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 186 | 82.72
 
-#### Day 6
+#### Day 6 Breadth First Search Depth First Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0152 |[Maximum Product Subarray](src/main/ruby/g0101_0200/s0152_maximum_product_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 63 | 80.30
+| 0200 |[Number of Islands](src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 141 | 72.68
 
-#### Day 7
+#### Day 7 Breadth First Search Depth First Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0121 |[Best Time to Buy and Sell Stock](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 147 | 80.21
 
-#### Day 8
+#### Day 8 Breadth First Search Depth First Search
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 9
+#### Day 9 Recursion Backtracking
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| 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) | 64 | 79.31
-| 0042 |[Trapping Rain Water](src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 69 | 80.74
+| 0078 |[Subsets](src/main/ruby/g0001_0100/s0078_subsets/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 63 | 70.43
 
-#### Day 10
+#### Day 10 Recursion Backtracking
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0039 |[Combination Sum](src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 79 | 74.84
 
-#### Day 11
+#### Day 11 Recursion Backtracking
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0096 |[Unique Binary Search Trees](src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb)| Medium | Top_100_Liked_Questions, Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 57 | 61.54
+| 0017 |[Letter Combinations of a Phone Number](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 49 | 93.94
+| 0022 |[Generate Parentheses](src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 43 | 100.00
+| 0079 |[Word Search](src/main/ruby/g0001_0100/s0079_word_search/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 56 | 100.00
 
-#### Day 12
+#### Day 12 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
 
-#### Day 13
+#### Day 13 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0045 |[Jump Game II](src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 68 | 75.23
+| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
 
-#### Day 14
+#### Day 14 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
 
-#### Day 15
+#### Day 15 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
+| 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| 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) | 64 | 79.31
 
-#### Day 16
+#### Day 16 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0064 |[Minimum Path Sum](src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 78 | 52.50
-| 0221 |[Maximal Square](src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 184 | 80.00
+| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
 
-#### Day 17
+#### Day 17 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
+| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
 
-#### Day 18
+#### Day 18 Dynamic Programming
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
+| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
+| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
 
-#### Day 19
+#### Day 19 Bit Manipulation
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
-| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
 
-#### Day 20
+#### Day 20 Others
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
 
-#### Day 21
+#### Day 21 Others
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-### Programming Skills I
+### Binary Search I
 
-#### Day 1 Basic Data Type
+#### Day 1
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 2 Operator
+#### Day 2
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0035 |[Search Insert Position](src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 48 | 97.37
 
-#### Day 3 Conditional Statements
+#### Day 3
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 4 Loop
+#### Day 4
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 5 Function
+#### Day 5
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 60 | 77.52
 
-#### Day 6 Array
+#### Day 6
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 95 | 78.01
 
-#### Day 7 Array
+#### Day 7
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 8 String
+#### Day 8
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
 
-#### Day 9 String
+#### Day 9
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
 
-#### Day 10 Linked List and Tree
+#### Day 10
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| 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) | 55 | 96.72
 
-#### Day 11 Containers and Libraries
+#### Day 11
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0033 |[Search in Rotated Sorted Array](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 59 | 74.85
 
-#### Day 12 Class and Object
+#### Day 12
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
 
-### Programming Skills II
+### Binary Search II
 
 #### Day 1
 
@@ -1314,6 +1503,7 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
 
 #### Day 4
 
@@ -1324,23 +1514,23 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0287 |[Find the Duplicate Number](src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 107 | 81.25
 
 #### Day 6
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0739 |[Daily Temperatures](src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 490 | 84.71
 
 #### Day 7
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0048 |[Rotate Image](src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 50 | 93.64
 
 #### Day 8
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
+| 0240 |[Search a 2D Matrix II](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 154 | 100.00
 
 #### Day 9
 
@@ -1356,13 +1546,11 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0049 |[Group Anagrams](src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 154 | 83.69
 
 #### Day 12
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0438 |[Find All Anagrams in a String](src/main/ruby/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 186 | 82.72
 
 #### Day 13
 
@@ -1373,13 +1561,11 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0138 |[Copy List with Random Pointer](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 65 | 69.84
 
 #### Day 15
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0002 |[Add Two Numbers](src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)) | 68 | 97.48
 
 #### Day 16
 
@@ -1395,7 +1581,6 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
 
 #### Day 19
 
@@ -1411,110 +1596,110 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
-| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
-| 0763 |[Partition Labels](src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb)| 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) | 62 | 100.00
-| 0739 |[Daily Temperatures](src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 490 | 84.71
-| 0647 |[Palindromic Substrings](src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n) | 101 | 100.00
+| 1143 |[Longest Common Subsequence](src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 828 | 75.00
+| 0763 |[Partition Labels](src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb)| Medium | String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1) | 62 | 100.00
+| 0739 |[Daily Temperatures](src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 490 | 84.71
+| 0647 |[Palindromic Substrings](src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb)| Medium | String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n) | 101 | 100.00
 | 0560 |[Subarray Sum Equals K](src/main/ruby/g0501_0600/s0560_subarray_sum_equals_k/solution.rb)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array, Big_O_Time_O(n)_Space_O(n) | 112 | 51.61
 | 0543 |[Diameter of Binary Tree](src/main/ruby/g0501_0600/s0543_diameter_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 64 | 86.54
-| 0494 |[Target Sum](src/main/ruby/g0401_0500/s0494_target_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n\*(sum+s))_Space_O(n\*(sum+s)) | 149 | 76.92
+| 0494 |[Target Sum](src/main/ruby/g0401_0500/s0494_target_sum/solution.rb)| Medium | Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n\*(sum+s))_Space_O(n\*(sum+s)) | 149 | 76.92
 | 0438 |[Find All Anagrams in a String](src/main/ruby/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer, Big_O_Time_O(n+m)_Space_O(1) | 186 | 82.72
-| 0437 |[Path Sum III](src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 205 | 61.54
+| 0437 |[Path Sum III](src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 205 | 61.54
 | 0416 |[Partition Equal Subset Sum](src/main/ruby/g0401_0500/s0416_partition_equal_subset_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming, Big_O_Time_O(n\*sums)_Space_O(n\*sums) | 1023 | 60.38
-| 0394 |[Decode String](src/main/ruby/g0301_0400/s0394_decode_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 58 | 84.09
-| 0347 |[Top K Frequent Elements](src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb)| 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) | 67 | 83.85
-| 0338 |[Counting Bits](src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb)| Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 90 | 96.34
-| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| 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, Level_2_Day_12_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
-| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| 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) | 68 | 96.55
-| 0295 |[Find Median from Data Stream](src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb)| 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) | 314 | 95.00
-| 0287 |[Find the Duplicate Number](src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb)| 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) | 107 | 81.25
-| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| 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) | 95 | 78.01
-| 0240 |[Search a 2D Matrix II](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb)| 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) | 154 | 100.00
-| 0239 |[Sliding Window Maximum](src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb)| 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) | 511 | 77.78
-| 0238 |[Product of Array Except Self](src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb)| 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) | 123 | 76.59
-| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_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) | 75 | 86.57
-| 0234 |[Palindrome Linked List](src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb)| 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) | 297 | 78.26
-| 0230 |[Kth Smallest Element in a BST](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb)| 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) | 68 | 89.41
-| 0226 |[Invert Binary Tree](src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 54 | 89.43
-| 0221 |[Maximal Square](src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Big_O_Time_O(m\*n)_Space_O(m\*n) | 184 | 80.00
-| 0215 |[Kth Largest Element in an Array](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 123 | 93.55
-| 0208 |[Implement Trie (Prefix Tree)](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 167 | 69.81
-| 0207 |[Course Schedule](src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N) | 60 | 95.42
-| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
-| 0200 |[Number of Islands](src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Big_O_Time_O(M\*N)_Space_O(M\*N) | 141 | 72.68
-| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
-| 0189 |[Rotate Array](src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 100 | 92.40
-| 0169 |[Majority Element](src/main/ruby/g0101_0200/s0169_majority_element/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array, Udemy_Famous_Algorithm, Big_O_Time_O(n)_Space_O(1) | 75 | 64.60
+| 0394 |[Decode String](src/main/ruby/g0301_0400/s0394_decode_string/solution.rb)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 58 | 84.09
+| 0347 |[Top K Frequent Elements](src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb)| 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) | 67 | 83.85
+| 0338 |[Counting Bits](src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 90 | 96.34
+| 0322 |[Coin Change](src/main/ruby/g0301_0400/s0322_coin_change/solution.rb)| 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, Top_Interview_150_1D_DP, Big_O_Time_O(m\*n)_Space_O(amount) | 655 | 84.96
+| 0300 |[Longest Increasing Subsequence](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb)| 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, Top_Interview_150_1D_DP, Big_O_Time_O(n\*log_n)_Space_O(n) | 68 | 96.55
+| 0295 |[Find Median from Data Stream](src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Top_Interview_150_Heap, Big_O_Time_O(n\*log_n)_Space_O(n) | 314 | 95.00
+| 0287 |[Find the Duplicate Number](src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb)| 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) | 107 | 81.25
+| 0283 |[Move Zeroes](src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 95 | 78.01
+| 0240 |[Search a 2D Matrix II](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb)| 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) | 154 | 100.00
+| 0239 |[Sliding Window Maximum](src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb)| 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) | 511 | 77.78
+| 0238 |[Product of Array Except Self](src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Data_Structure_II_Day_5_Array, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 123 | 76.59
+| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 75 | 86.57
+| 0234 |[Palindrome Linked List](src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb)| 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) | 297 | 78.26
+| 0230 |[Kth Smallest Element in a BST](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb)| 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, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 68 | 89.41
+| 0226 |[Invert Binary Tree](src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 54 | 89.43
+| 0221 |[Maximal Square](src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb)| Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m\*n)_Space_O(m\*n) | 184 | 80.00
+| 0215 |[Kth Largest Element in an Array](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Data_Structure_II_Day_20_Heap_Priority_Queue, Top_Interview_150_Heap, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 123 | 93.55
+| 0208 |[Implement Trie (Prefix Tree)](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Top_Interview_150_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 167 | 69.81
+| 0207 |[Course Schedule](src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Top_Interview_150_Graph_General, Big_O_Time_O(N)_Space_O(N) | 60 | 95.42
+| 0206 |[Reverse Linked List](src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 52 | 93.99
+| 0200 |[Number of Islands](src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Top_Interview_150_Graph_General, Big_O_Time_O(M\*N)_Space_O(M\*N) | 141 | 72.68
+| 0198 |[House Robber](src/main/ruby/g0101_0200/s0198_house_robber/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 41 | 99.28
+| 0189 |[Rotate Array](src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 100 | 92.40
+| 0169 |[Majority Element](src/main/ruby/g0101_0200/s0169_majority_element/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array, Udemy_Famous_Algorithm, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 75 | 64.60
 | 0160 |[Intersection of Two Linked Lists](src/main/ruby/g0101_0200/s0160_intersection_of_two_linked_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Udemy_Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 108 | 75.86
-| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| Easy | 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) | 76 | 79.40
-| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
+| 0155 |[Min Stack](src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb)| 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, Top_Interview_150_Stack, Big_O_Time_O(1)_Space_O(N) | 76 | 79.40
+| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Top_Interview_150_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
 | 0152 |[Maximum Product Subarray](src/main/ruby/g0101_0200/s0152_maximum_product_subarray/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Dynamic_Programming_I_Day_6, Level_2_Day_13_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 63 | 80.30
-| 0148 |[Sort List](src/main/ruby/g0101_0200/s0148_sort_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Level_2_Day_4_Linked_List, Big_O_Time_O(log(N))_Space_O(log(N)) | 188 | 84.21
-| 0146 |[LRU Cache](src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 290 | 78.05
+| 0148 |[Sort List](src/main/ruby/g0101_0200/s0148_sort_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Level_2_Day_4_Linked_List, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(log(N))_Space_O(log(N)) | 188 | 84.21
+| 0146 |[LRU Cache](src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 290 | 78.05
 | 0142 |[Linked List Cycle II](src/main/ruby/g0101_0200/s0142_linked_list_cycle_ii/solution.rb)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 62 | 93.94
-| 0141 |[Linked List Cycle](src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 97.65
-| 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 64 | 79.31
-| 0138 |[Copy List with Random Pointer](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(N) | 65 | 69.84
-| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
+| 0141 |[Linked List Cycle](src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 97.65
+| 0139 |[Word Break](src/main/ruby/g0101_0200/s0139_word_break/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 64 | 79.31
+| 0138 |[Copy List with Random Pointer](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(N) | 65 | 69.84
+| 0136 |[Single Number](src/main/ruby/g0101_0200/s0136_single_number/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Top_Interview_150_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 68 | 78.44
 | 0131 |[Palindrome Partitioning](src/main/ruby/g0101_0200/s0131_palindrome_partitioning/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N\*2^N)_Space_O(2^N\*N) | 1192 | 63.64
-| 0128 |[Longest Consecutive Sequence](src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Big_O_Time_O(N_log_N)_Space_O(1) | 135 | 91.36
-| 0124 |[Binary Tree Maximum Path Sum](src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(N)_Space_O(N) | 71 | 98.00
-| 0121 |[Best Time to Buy and Sell Stock](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Big_O_Time_O(N)_Space_O(1) | 147 | 80.21
-| 0114 |[Flatten Binary Tree to Linked List](src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(N) | 47 | 100.00
-| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Big_O_Time_O(N)_Space_O(N) | 71 | 91.78
-| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(N)_Space_O(H) | 55 | 96.72
-| 0102 |[Binary Tree Level Order Traversal](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(N)_Space_O(N) | 66 | 76.43
-| 0101 |[Symmetric Tree](src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 58 | 91.34
-| 0098 |[Validate Binary Search Tree](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(N)_Space_O(log(N)) | 68 | 70.23
-| 0096 |[Unique Binary Search Trees](src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb)| 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) | 57 | 61.54
+| 0128 |[Longest Consecutive Sequence](src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Top_Interview_150_Hashmap, Big_O_Time_O(N_log_N)_Space_O(1) | 135 | 91.36
+| 0124 |[Binary Tree Maximum Path Sum](src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 71 | 98.00
+| 0121 |[Best Time to Buy and Sell Stock](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(N)_Space_O(1) | 147 | 80.21
+| 0114 |[Flatten Binary Tree to Linked List](src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 47 | 100.00
+| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 71 | 91.78
+| 0104 |[Maximum Depth of Binary Tree](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H) | 55 | 96.72
+| 0102 |[Binary Tree Level Order Traversal](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS, Big_O_Time_O(N)_Space_O(N) | 66 | 76.43
+| 0101 |[Symmetric Tree](src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(log(N)) | 58 | 91.34
+| 0098 |[Validate Binary Search Tree](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 68 | 70.23
+| 0096 |[Unique Binary Search Trees](src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11, Big_O_Time_O(n)_Space_O(1) | 57 | 61.54
 | 0094 |[Binary Tree Inorder Traversal](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 56 | 84.00
 | 0084 |[Largest Rectangle in Histogram](src/main/ruby/g0001_0100/s0084_largest_rectangle_in_histogram/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n_log_n)_Space_O(log_n) | 197 | 98.25
-| 0079 |[Word Search](src/main/ruby/g0001_0100/s0079_word_search/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 56 | 100.00
+| 0079 |[Word Search](src/main/ruby/g0001_0100/s0079_word_search/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Top_Interview_150_Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 56 | 100.00
 | 0078 |[Subsets](src/main/ruby/g0001_0100/s0078_subsets/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Algorithm_II_Day_9_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 63 | 70.43
-| 0076 |[Minimum Window Substring](src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Big_O_Time_O(s.length())_Space_O(1) | 175 | 93.33
+| 0076 |[Minimum Window Substring](src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Top_Interview_150_Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 175 | 93.33
 | 0075 |[Sort Colors](src/main/ruby/g0001_0100/s0075_sort_colors/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_2_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 54 | 88.46
-| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8, Level_2_Day_8_Binary_Search, Udemy_2D_Arrays/Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
-| 0073 |[Set Matrix Zeroes](src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Udemy_2D_Arrays/Matrix, Big_O_Time_O(m\*n)_Space_O(1) | 59 | 100.00
-| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Hard | 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) | 139 | 73.91
-| 0070 |[Climbing Stairs](src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 48 | 96.01
-| 0064 |[Minimum Path Sum](src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 78 | 52.50
-| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
-| 0056 |[Merge Intervals](src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array, Level_2_Day_17_Interval, Udemy_2D_Arrays/Matrix, Big_O_Time_O(n_log_n)_Space_O(n) | 103 | 74.70
-| 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_4, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
-| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| Easy | 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) | 125 | 81.22
+| 0074 |[Search a 2D Matrix](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8, Level_2_Day_8_Binary_Search, Udemy_2D_Arrays/Matrix, Top_Interview_150_Binary_Search, Big_O_Time_O(endRow+endCol)_Space_O(1) | 50 | 97.83
+| 0073 |[Set Matrix Zeroes](src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix, Big_O_Time_O(m\*n)_Space_O(1) | 59 | 100.00
+| 0072 |[Edit Distance](src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n^2)_Space_O(n2) | 139 | 73.91
+| 0070 |[Climbing Stairs](src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 48 | 96.01
+| 0064 |[Minimum Path Sum](src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m\*n)_Space_O(m\*n) | 78 | 52.50
+| 0062 |[Unique Paths](src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 50 | 91.92
+| 0056 |[Merge Intervals](src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array, Level_2_Day_17_Interval, Udemy_2D_Arrays/Matrix, Top_Interview_150_Intervals, Big_O_Time_O(n_log_n)_Space_O(n) | 103 | 74.70
+| 0055 |[Jump Game](src/main/ruby/g0001_0100/s0055_jump_game/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_4, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 88 | 95.88
+| 0053 |[Maximum Subarray](src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb)| 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, Top_Interview_150_Kadane's_Algorithm, Big_O_Time_O(n)_Space_O(1) | 125 | 81.22
 | 0051 |[N-Queens](src/main/ruby/g0001_0100/s0051_n_queens/solution.rb)| Hard | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(N!)_Space_O(N) | 82 | 88.89
-| 0049 |[Group Anagrams](src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 154 | 83.69
-| 0048 |[Rotate Image](src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Data_Structure_II_Day_3_Array, Programming_Skills_II_Day_7, Udemy_2D_Arrays/Matrix, Big_O_Time_O(n^2)_Space_O(1) | 50 | 93.64
-| 0046 |[Permutations](src/main/ruby/g0001_0100/s0046_permutations/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 62 | 89.60
-| 0045 |[Jump Game II](src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4, Big_O_Time_O(n)_Space_O(1) | 68 | 75.23
-| 0042 |[Trapping Rain Water](src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 69 | 80.74
+| 0049 |[Group Anagrams](src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings, Top_Interview_150_Hashmap, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 154 | 83.69
+| 0048 |[Rotate Image](src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Data_Structure_II_Day_3_Array, Programming_Skills_II_Day_7, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix, Big_O_Time_O(n^2)_Space_O(1) | 50 | 93.64
+| 0046 |[Permutations](src/main/ruby/g0001_0100/s0046_permutations/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 62 | 89.60
+| 0045 |[Jump Game II](src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 68 | 75.23
+| 0042 |[Trapping Rain Water](src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 69 | 80.74
 | 0041 |[First Missing Positive](src/main/ruby/g0001_0100/s0041_first_missing_positive/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Udemy_Arrays, Big_O_Time_O(n)_Space_O(n) | 130 | 65.63
-| 0039 |[Combination Sum](src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n+2^n) | 79 | 74.84
-| 0035 |[Search Insert Position](src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_2, Big_O_Time_O(log_n)_Space_O(1) | 48 | 97.37
-| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_5, Big_O_Time_O(log_n)_Space_O(1) | 60 | 77.52
-| 0033 |[Search in Rotated Sorted Array](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_11, Level_2_Day_8_Binary_Search, Udemy_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 59 | 74.85
+| 0039 |[Combination Sum](src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb)| Medium | Top_100_Liked_Questions, Array, Backtracking, Algorithm_II_Day_10_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 79 | 74.84
+| 0035 |[Search Insert Position](src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_I_Day_1_Binary_Search, Binary_Search_I_Day_2, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 48 | 97.37
+| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_5, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 60 | 77.52
+| 0033 |[Search in Rotated Sorted Array](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_11, Level_2_Day_8_Binary_Search, Udemy_Binary_Search, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 59 | 74.85
 | 0032 |[Longest Valid Parentheses](src/main/ruby/g0001_0100/s0032_longest_valid_parentheses/solution.rb)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Stack, Big_O_Time_O(n)_Space_O(1) | 73 | 82.61
 | 0031 |[Next Permutation](src/main/ruby/g0001_0100/s0031_next_permutation/solution.rb)| Medium | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 58 | 82.76
-| 0025 |[Reverse Nodes in k-Group](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(k) | 62 | 91.67
+| 0025 |[Reverse Nodes in k-Group](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_13_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(n)_Space_O(k) | 62 | 91.67
 | 0024 |[Swap Nodes in Pairs](src/main/ruby/g0001_0100/s0024_swap_nodes_in_pairs/solution.rb)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Data_Structure_II_Day_12_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 59 | 76.00
-| 0023 |[Merge k Sorted Lists](src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(k\*n\*log(k))_Space_O(log(k)) | 76 | 87.95
-| 0022 |[Generate Parentheses](src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n) | 43 | 100.00
-| 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
-| 0020 |[Valid Parentheses](src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 53 | 90.52
-| 0019 |[Remove Nth Node From End of List](src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Big_O_Time_O(L)_Space_O(L) | 51 | 95.27
-| 0017 |[Letter Combinations of a Phone Number](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(4^n)_Space_O(n) | 49 | 93.94
-| 0015 |[3Sum](src/main/ruby/g0001_0100/s0015_3sum/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 659 | 83.74
-| 0011 |[Container With Most Water](src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 114 | 95.98
-| 0010 |[Regular Expression Matching](src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb)| 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) | 66 | 94.44
-| 0009 |[Palindrome Number](src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb)| Easy | Math, Udemy_Integers | 83 | 74.19
+| 0023 |[Merge k Sorted Lists](src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Heap_Priority_Queue, Linked_List, Divide_and_Conquer, Merge_Sort, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(k\*n\*log(k))_Space_O(log(k)) | 76 | 87.95
+| 0022 |[Generate Parentheses](src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 43 | 100.00
+| 0021 |[Merge Two Sorted Lists](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(m+n)_Space_O(m+n) | 66 | 59.01
+| 0020 |[Valid Parentheses](src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Top_Interview_150_Stack, Big_O_Time_O(n)_Space_O(n) | 53 | 90.52
+| 0019 |[Remove Nth Node From End of List](src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(L)_Space_O(L) | 51 | 95.27
+| 0017 |[Letter Combinations of a Phone Number](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 49 | 93.94
+| 0015 |[3Sum](src/main/ruby/g0001_0100/s0015_3sum/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 659 | 83.74
+| 0011 |[Container With Most Water](src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 114 | 95.98
+| 0010 |[Regular Expression Matching](src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 66 | 94.44
+| 0009 |[Palindrome Number](src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb)| Easy | Math, Udemy_Integers, Top_Interview_150_Math | 83 | 74.19
 | 0008 |[String to Integer (atoi)](src/main/ruby/g0001_0100/s0008_string_to_integer_atoi/solution.rb)| Medium | Top_Interview_Questions, String | 67 | 67.26
 | 0007 |[Reverse Integer](src/main/ruby/g0001_0100/s0007_reverse_integer/solution.rb)| Medium | Top_Interview_Questions, Math, Udemy_Integers | 58 | 75.27
-| 0006 |[Zigzag Conversion](src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb)| Medium | String | 77 | 100.00
-| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
-| 0004 |[Median of Two Sorted Arrays](src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1) | 64 | 93.81
-| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Big_O_Time_O(n)_Space_O(1) | 94 | 85.62
-| 0002 |[Add Two Numbers](src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Data_Structure_II_Day_10_Linked_List, Programming_Skills_II_Day_15, Big_O_Time_O(max(N,M))_Space_O(max(N,M)) | 68 | 97.48
-| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Data_Structure_I_Day_2_Array, Level_1_Day_13_Hashmap, Udemy_Arrays, Big_O_Time_O(n)_Space_O(n) | 57 | 89.38
+| 0006 |[Zigzag Conversion](src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb)| Medium | String, Top_Interview_150_Array/String | 77 | 100.00
+| 0005 |[Longest Palindromic Substring](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n)_Space_O(n) | 117 | 98.63
+| 0004 |[Median of Two Sorted Arrays](src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Top_Interview_150_Binary_Search, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task | 64 | 93.81
+| 0003 |[Longest Substring Without Repeating Characters](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Top_Interview_150_Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 94 | 85.62
+| 0002 |[Add Two Numbers](src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Data_Structure_II_Day_10_Linked_List, Programming_Skills_II_Day_15, Top_Interview_150_Linked_List, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 68 | 97.48
+| 0001 |[Two Sum](src/main/ruby/g0001_0100/s0001_two_sum/solution.rb)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Data_Structure_I_Day_2_Array, Level_1_Day_13_Hashmap, Udemy_Arrays, Top_Interview_150_Hashmap, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 57 | 89.38
 
 ## Contributing
 Your ideas/fixes/algorithms are more than welcome!
diff --git a/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb b/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb
index cbc9351..2b22110 100644
--- a/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb
+++ b/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb
@@ -1,5 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
-# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
+# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap
+# #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task
 # #2023_11_08_Time_57_ms_(89.38%)_Space_212.2_MB_(11.34%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb b/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb
index 68f926e..8427e36 100644
--- a/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb
+++ b/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
 # #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
-# #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
-# #2023_11_11_Time_68_ms_(97.48%)_Space_211.1_MB_(55.38%)
+# #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
+# #AI_can_be_used_to_solve_the_task #2023_11_11_Time_68_ms_(97.48%)_Space_211.1_MB_(55.38%)
 
 require_relative '../../com_github_leetcode/list_node'
 
diff --git a/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb b/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb
index d4f35e2..369b4bb 100644
--- a/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb
+++ b/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
 # #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
-# #Big_O_Time_O(n)_Space_O(1) #2023_11_12_Time_94_ms_(85.62%)_Space_211.3_MB_(45.32%)
+# #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
+# #2023_11_12_Time_94_ms_(85.62%)_Space_211.3_MB_(45.32%)
 
 # @param {String} s
 # @return {Integer}
diff --git a/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb b/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb
index 743890c..a8ccdea 100644
--- a/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb
+++ b/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb
@@ -1,5 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
-# #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2023_11_12_Time_64_ms_(93.81%)_Space_212.7_MB_(57.89%)
+# #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
+# #AI_can_be_used_to_solve_the_task #2023_11_12_Time_64_ms_(93.81%)_Space_212.7_MB_(57.89%)
 
 # @param {Integer[]} nums1
 # @param {Integer[]} nums2
diff --git a/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb b/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb
index 8113f46..19b8901 100644
--- a/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb
+++ b/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 # #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
-# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
-# #2023_11_12_Time_117_ms_(98.63%)_Space_211_MB_(92.47%)
+# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
+# #Big_O_Time_O(n)_Space_O(n) #2023_11_12_Time_117_ms_(98.63%)_Space_211_MB_(92.47%)
 
 # @param {String} s
 # @return {String}
diff --git a/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb b/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb
index c646765..8dbb188 100644
--- a/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb
+++ b/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb
@@ -1,4 +1,5 @@
-# #Medium #String #2023_11_14_Time_77_ms_(100.00%)_Space_211_MB_(89.81%)
+# #Medium #String #Top_Interview_150_Array/String
+# #2023_11_14_Time_77_ms_(100.00%)_Space_211_MB_(89.81%)
 
 # @param {String} s
 # @param {Integer} num_rows
diff --git a/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb b/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb
index c2889a6..9659579 100644
--- a/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb
+++ b/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb
@@ -1,4 +1,5 @@
-# #Easy #Math #Udemy_Integers #2023_11_14_Time_83_ms_(74.19%)_Space_211.1_MB_(43.29%)
+# #Easy #Math #Udemy_Integers #Top_Interview_150_Math
+# #2023_11_14_Time_83_ms_(74.19%)_Space_211.1_MB_(43.29%)
 
 # @param {Integer} x
 # @return {Boolean}
diff --git a/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb b/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb
index f6c1dff..0dc9bd4 100644
--- a/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb
+++ b/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb
@@ -1,6 +1,5 @@
-# #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_11_14_Time_66_ms_(94.44%)_Space_211_MB_(36.11%)
+# #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2023_11_14_Time_66_ms_(94.44%)_Space_211_MB_(36.11%)
 
 # @param {String} s
 # @param {String} p
diff --git a/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb b/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb
index 8f9babd..947b107 100644
--- a/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb
+++ b/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
-# #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
-# #2023_11_17_Time_114_ms_(95.98%)_Space_217.5_MB_(71.21%)
+# #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
+# #Big_O_Time_O(n)_Space_O(1) #2023_11_17_Time_114_ms_(95.98%)_Space_217.5_MB_(71.21%)
 
 # @param {Integer[]} height
 # @return {Integer}
diff --git a/src/main/ruby/g0001_0100/s0015_3sum/solution.rb b/src/main/ruby/g0001_0100/s0015_3sum/solution.rb
index 4a9dcd1..3c3dce3 100644
--- a/src/main/ruby/g0001_0100/s0015_3sum/solution.rb
+++ b/src/main/ruby/g0001_0100/s0015_3sum/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
 # #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers
-# #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_11_17_Time_659_ms_(83.74%)_Space_214.1_MB_(59.36%)
+# #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
+# #2023_11_17_Time_659_ms_(83.74%)_Space_214.1_MB_(59.36%)
 
 # @param {Integer[]} nums
 # @return {Integer[][]}
diff --git a/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb b/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb
index 8e40310..c523b6a 100644
--- a/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb
+++ b/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
-# #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
-# #Big_O_Time_O(4^n)_Space_O(n) #2023_11_17_Time_49_ms_(93.94%)_Space_210.9_MB_(97.73%)
+# #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking
+# #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
+# #2023_11_17_Time_49_ms_(93.94%)_Space_210.9_MB_(97.73%)
 
 # @param {String} digits
 # @return {String[]}
diff --git a/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb b/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb
index aee2b8e..0f994ec 100644
--- a/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb
+++ b/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List
-# #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
-# #2023_11_17_Time_51_ms_(95.27%)_Space_211_MB_(50.00%)
+# #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List
+# #Big_O_Time_O(L)_Space_O(L) #2023_11_17_Time_51_ms_(95.27%)_Space_211_MB_(50.00%)
 
 # Definition for singly-linked list.
 # class ListNode
diff --git a/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb b/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb
index b14335d..12368ec 100644
--- a/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb
+++ b/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb
@@ -1,6 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
-# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
-# #2023_11_17_Time_53_ms_(90.52%)_Space_211.2_MB_(35.11%)
+# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
+# #Big_O_Time_O(n)_Space_O(n) #2023_11_17_Time_53_ms_(90.52%)_Space_211.2_MB_(35.11%)
 
 # @param {String} s
 # @return {Boolean}
diff --git a/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb b/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb
index 9b7271e..5b0133b 100644
--- a/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb
+++ b/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
 # #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
-# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
-# #2023_11_17_Time_66_ms_(59.01%)_Space_210.9_MB_(88.79%)
+# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
+# #Big_O_Time_O(m+n)_Space_O(m+n) #2023_11_17_Time_66_ms_(59.01%)_Space_210.9_MB_(88.79%)
 
 # Definition for singly-linked list.
 # class ListNode
diff --git a/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb b/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb
index 4f2ba41..1885195 100644
--- a/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb
+++ b/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 # #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
-# #Big_O_Time_O(2^n)_Space_O(n) #2023_11_17_Time_43_ms_(100.00%)_Space_211.3_MB_(83.90%)
+# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
+# #2023_11_17_Time_43_ms_(100.00%)_Space_211.3_MB_(83.90%)
 
 # @param {Integer} n
 # @return {String[]}
diff --git a/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb b/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb
index 694af02..24c5d31 100644
--- a/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb
+++ b/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb
@@ -1,5 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
-# #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
+# #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer
+# #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
 # #2023_11_17_Time_76_ms_(87.95%)_Space_212.3_MB_(83.13%)
 
 # Definition for singly-linked list.
diff --git a/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb b/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb
index 0be3d36..deb5fb3 100644
--- a/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb
+++ b/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb
@@ -1,5 +1,5 @@
 # #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
-# #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
+# #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k)
 # #2023_11_17_Time_62_ms_(91.67%)_Space_211.1_MB_(66.67%)
 
 # Definition for singly-linked list.
diff --git a/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb b/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb
index 39b6e82..ac4f9eb 100644
--- a/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb
+++ b/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
 # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search
-# #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
+# #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
 # #2023_11_19_Time_59_ms_(74.85%)_Space_211.3_MB_(12.57%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb b/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb
index 3343a0a..e994a5d 100644
--- a/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb
+++ b/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
-# #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
-# #2023_11_19_Time_60_ms_(77.52%)_Space_211.7_MB_(22.94%)
+# #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search
+# #Big_O_Time_O(log_n)_Space_O(1) #2023_11_19_Time_60_ms_(77.52%)_Space_211.7_MB_(22.94%)
 
 # @param {Integer[]} nums
 # @param {Integer} target
diff --git a/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb b/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb
index 487153e..046f312 100644
--- a/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb
+++ b/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb
@@ -1,5 +1,5 @@
 # #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
-# #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
+# #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
 # #2023_11_19_Time_48_ms_(97.37%)_Space_211.2_MB_(92.98%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb b/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb
index 18ce6b8..e3947ff 100644
--- a/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb
+++ b/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
 # #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
-# #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_11_19_Time_79_ms_(74.84%)_Space_211.2_MB_(48.43%)
+# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
+# #2023_11_19_Time_79_ms_(74.84%)_Space_211.2_MB_(48.43%)
 
 # @param {Integer[]} candidates
 # @param {Integer} target
diff --git a/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb b/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb
index dd8f461..e15b3b6 100644
--- a/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb
+++ b/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb
@@ -1,6 +1,7 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers
 # #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers
-# #Big_O_Time_O(n)_Space_O(1) #2023_11_19_Time_69_ms_(80.74%)_Space_212_MB_(57.04%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+# #2023_11_19_Time_69_ms_(80.74%)_Space_212_MB_(57.04%)
 
 # @param {Integer[]} height
 # @return {Integer}
diff --git a/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb b/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb
index f4508e3..7dc71a2 100644
--- a/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb
+++ b/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
 # #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
-# #Big_O_Time_O(n)_Space_O(1) #2023_11_19_Time_68_ms_(75.23%)_Space_211.9_MB_(79.82%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+# #2023_11_19_Time_68_ms_(75.23%)_Space_211.9_MB_(79.82%)
 
 # @param {Integer[]} nums
 # @return {Integer}
diff --git a/src/main/ruby/g0001_0100/s0046_permutations/solution.rb b/src/main/ruby/g0001_0100/s0046_permutations/solution.rb
index c45dfe9..bb2ec95 100644
--- a/src/main/ruby/g0001_0100/s0046_permutations/solution.rb
+++ b/src/main/ruby/g0001_0100/s0046_permutations/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
 # #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
-# #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!)
+# #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!)
 # #2023_11_19_Time_62_ms_(89.60%)_Space_211.1_MB_(64.00%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb b/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb
index 175fafd..4c9a323 100644
--- a/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb
+++ b/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix
 # #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix
-# #Big_O_Time_O(n^2)_Space_O(1) #2023_11_21_Time_50_ms_(93.64%)_Space_211_MB_(87.27%)
+# #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
+# #2023_11_21_Time_50_ms_(93.64%)_Space_211_MB_(87.27%)
 
 # @param {Integer[][]} matrix
 # @return {Void} Do not return anything, modify matrix in-place instead.
diff --git a/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb b/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb
index 5342b0d..1dc3b17 100644
--- a/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb
+++ b/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting
 # #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings
-# #Big_O_Time_O(n*k_log_k)_Space_O(n) #2023_11_21_Time_154_ms_(83.69%)_Space_216_MB_(66.43%)
+# #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
+# #2023_11_21_Time_154_ms_(83.69%)_Space_216_MB_(66.43%)
 
 # @param {String[]} strs
 # @return {String[][]}
diff --git a/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb b/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb
index d093912..0b00f64 100644
--- a/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb
+++ b/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb
@@ -1,6 +1,6 @@
-# #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)
+# #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
 # #2023_11_21_Time_125_ms_(81.22%)_Space_218.9_MB_(87.31%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb b/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb
index 1488703..2f6414d 100644
--- a/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb
+++ b/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy
 # #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays
-# #Big_O_Time_O(n)_Space_O(1) #2023_11_21_Time_88_ms_(95.88%)_Space_216_MB_(77.32%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+# #2023_11_21_Time_88_ms_(95.88%)_Space_216_MB_(77.32%)
 
 # @param {Integer[]} nums
 # @return {Boolean}
diff --git a/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb b/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb
index f136a5f..2daad82 100644
--- a/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb
+++ b/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
 # #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
-# #Big_O_Time_O(n_log_n)_Space_O(n) #2023_11_21_Time_103_ms_(74.70%)_Space_212.5_MB_(84.34%)
+# #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
+# #2023_11_21_Time_103_ms_(74.70%)_Space_212.5_MB_(84.34%)
 
 # @param {Integer[][]} intervals
 # @return {Integer[][]}
diff --git a/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb b/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb
index f67a961..ca1cbec 100644
--- a/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb
+++ b/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
-# #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15
-# #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
-# #2023_11_21_Time_50_ms_(91.92%)_Space_211.1_MB_(52.53%)
+# #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
+# #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2023_11_21_Time_50_ms_(91.92%)_Space_211.1_MB_(52.53%)
 
 # @param {Integer} m
 # @param {Integer} n
diff --git a/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb b/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb
index 6830ccb..e625c65 100644
--- a/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb
+++ b/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
-# #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
-# #2023_11_21_Time_78_ms_(52.50%)_Space_212.3_MB_(75.00%)
+# #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2023_11_21_Time_78_ms_(52.50%)_Space_212.3_MB_(75.00%)
 
 # @param {Integer[][]} grid
 # @return {Integer}
diff --git a/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb b/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb
index 83aeb28..afefc56 100644
--- a/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb
+++ b/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
 # #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
-# #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n)
-# #2023_11_21_Time_48_ms_(96.01%)_Space_211.1_MB_(19.60%)
+# #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
+# #Big_O_Time_O(n)_Space_O(n) #2023_11_21_Time_48_ms_(96.01%)_Space_211.1_MB_(19.60%)
 
 # @param {Integer} n
 # @return {Integer}
diff --git a/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb b/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb
index ab442f1..370c25b 100644
--- a/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb
+++ b/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb
@@ -1,6 +1,6 @@
-# #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
+# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
 # #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
-# #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
+# #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
 # #2023_11_21_Time_139_ms_(73.91%)_Space_211_MB_(100.00%)
 
 # @param {String} word1
diff --git a/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb b/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb
index c29b724..dbca45b 100644
--- a/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb
+++ b/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb
@@ -1,5 +1,5 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
-# #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1)
+# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1)
 # #2023_11_22_Time_59_ms_(100.00%)_Space_212.3_MB_(21.11%)
 
 # @param {Integer[][]} matrix
diff --git a/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb b/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb
index ef3d790..78b10ad 100644
--- a/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb
+++ b/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array
 # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search
-# #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1)
+# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1)
 # #2023_11_22_Time_50_ms_(97.83%)_Space_210.9_MB_(97.83%)
 
 # @param {Integer[][]} matrix
diff --git a/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb b/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb
index 25e8fb0..00eed41 100644
--- a/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb
+++ b/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb
@@ -1,6 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
-# #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1)
-# #2023_11_22_Time_175_ms_(93.33%)_Space_211.5_MB_(88.89%)
+# #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window
+# #Big_O_Time_O(s.length())_Space_O(1) #2023_11_22_Time_175_ms_(93.33%)_Space_211.5_MB_(88.89%)
 
 # @param {String} s
 # @param {String} t
diff --git a/src/main/ruby/g0001_0100/s0079_word_search/solution.rb b/src/main/ruby/g0001_0100/s0079_word_search/solution.rb
index 7cfb417..aa2b551 100644
--- a/src/main/ruby/g0001_0100/s0079_word_search/solution.rb
+++ b/src/main/ruby/g0001_0100/s0079_word_search/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking
-# #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n)
-# #2023_11_22_Time_56_ms_(100.00%)_Space_211_MB_(53.62%)
+# #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
+# #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2023_11_22_Time_56_ms_(100.00%)_Space_211_MB_(53.62%)
 
 # @param {Character[][]} board
 # @param {String} word
diff --git a/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb b/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb
index af001f3..b74868b 100644
--- a/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb
+++ b/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb
@@ -1,5 +1,5 @@
-# #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_11_22_Time_57_ms_(61.54%)_Space_211_MB_(76.92%)
 
 # @param {Integer} n
diff --git a/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb b/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb
index 5c1ee8c..a75dfed 100644
--- a/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb
+++ b/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
 # #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree
-# #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N))
+# #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N))
 # #2023_11_22_Time_68_ms_(70.23%)_Space_211.7_MB_(72.52%)
 
 require_relative '../../com_github_leetcode/tree_node'
diff --git a/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb b/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb
index bdba981..321a4ba 100644
--- a/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb
+++ b/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb
@@ -1,6 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
 # #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree
-# #Big_O_Time_O(N)_Space_O(log(N)) #2023_11_23_Time_58_ms_(91.34%)_Space_211.1_MB_(48.82%)
+# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
+# #2023_11_23_Time_58_ms_(91.34%)_Space_211.1_MB_(48.82%)
 
 # Definition for a binary tree node.
 # class TreeNode
diff --git a/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb b/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb
index 6eaaed7..68dcf75 100644
--- a/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb
+++ b/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb
@@ -1,6 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree
 # #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue
-# #Big_O_Time_O(N)_Space_O(N) #2023_11_23_Time_66_ms_(76.43%)_Space_211.3_MB_(57.86%)
+# #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N)
+# #2023_11_23_Time_66_ms_(76.43%)_Space_211.3_MB_(57.86%)
 
 # Definition for a binary tree node.
 # class TreeNode
diff --git a/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb b/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb
index 25edfd7..91e55c8 100644
--- a/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb
+++ b/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb
@@ -1,7 +1,8 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
-# #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
+# #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree
 # #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue
-# #Big_O_Time_O(N)_Space_O(H) #2023_11_23_Time_55_ms_(96.72%)_Space_211.3_MB_(37.23%)
+# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
+# #2023_11_23_Time_55_ms_(96.72%)_Space_211.3_MB_(37.23%)
 
 # Definition for a binary tree node.
 # class TreeNode
diff --git a/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb b/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb
index 16f6fad..410bb69 100644
--- a/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb
+++ b/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree
-# #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N)
-# #2023_11_23_Time_71_ms_(91.78%)_Space_212_MB_(79.45%)
+# #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General
+# #Big_O_Time_O(N)_Space_O(N) #2023_11_23_Time_71_ms_(91.78%)_Space_212_MB_(79.45%)
 
 # Definition for a binary tree node.
 # class TreeNode
diff --git a/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb b/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb
index c6fabb0..571871a 100644
--- a/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb
+++ b/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb
@@ -1,5 +1,5 @@
 # #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List
-# #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N)
+# #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N)
 # #2023_11_23_Time_47_ms_(100.00%)_Space_211_MB_(69.23%)
 
 # Definition for a binary tree node.
diff --git a/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb b/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb
index 88cf39a..f6a0fb3 100644
--- a/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb
+++ b/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb
@@ -1,6 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 # #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays
-# #Big_O_Time_O(N)_Space_O(1) #2023_11_23_Time_147_ms_(80.21%)_Space_220.8_MB_(82.79%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1)
+# #2023_11_23_Time_147_ms_(80.21%)_Space_220.8_MB_(82.79%)
 
 # @param {Integer[]} prices
 # @return {Integer}
diff --git a/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb b/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb
index f0279fb..dc6e63b 100644
--- a/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb
+++ b/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb
@@ -1,6 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search
-# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N)
-# #2023_11_23_Time_71_ms_(98.00%)_Space_213.4_MB_(74.00%)
+# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
+# #Big_O_Time_O(N)_Space_O(N) #2023_11_23_Time_71_ms_(98.00%)_Space_213.4_MB_(74.00%)
 
 # Definition for a binary tree node.
 # class TreeNode
diff --git a/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb b/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb
index 2089016..4756bb5 100644
--- a/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb
+++ b/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb
@@ -1,5 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find
-# #Big_O_Time_O(N_log_N)_Space_O(1) #2023_11_23_Time_135_ms_(91.36%)_Space_217.1_MB_(100.00%)
+# #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1)
+# #2023_11_23_Time_135_ms_(91.36%)_Space_217.1_MB_(100.00%)
 
 # @param {Integer[]} nums
 # @return {Integer}
diff --git a/src/main/ruby/g0101_0200/s0136_single_number/solution.rb b/src/main/ruby/g0101_0200/s0136_single_number/solution.rb
index adbda27..f903388 100644
--- a/src/main/ruby/g0101_0200/s0136_single_number/solution.rb
+++ b/src/main/ruby/g0101_0200/s0136_single_number/solution.rb
@@ -1,5 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
-# #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers
+# #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array
+# #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation
 # #Big_O_Time_O(N)_Space_O(1) #2023_11_23_Time_68_ms_(78.44%)_Space_212.3_MB_(66.51%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb b/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb
index c708340..8cbaf3e 100644
--- a/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb
+++ b/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List
-# #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N)
-# #2023_11_27_Time_65_ms_(69.84%)_Space_211.3_MB_(52.38%)
+# #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List
+# #Big_O_Time_O(N)_Space_O(N) #2023_11_27_Time_65_ms_(69.84%)_Space_211.3_MB_(52.38%)
 
 require_relative '../../com_github_leetcode/random/node'
 
diff --git a/src/main/ruby/g0101_0200/s0139_word_break/solution.rb b/src/main/ruby/g0101_0200/s0139_word_break/solution.rb
index 84fdf12..432975e 100644
--- a/src/main/ruby/g0101_0200/s0139_word_break/solution.rb
+++ b/src/main/ruby/g0101_0200/s0139_word_break/solution.rb
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table
 # #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming
-# #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max)
-# #2023_11_27_Time_64_ms_(79.31%)_Space_211.2_MB_(22.41%)
+# #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
+# #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2023_11_27_Time_64_ms_(79.31%)_Space_211.2_MB_(22.41%)
 
 # @param {String} s
 # @param {String[]} word_dict
diff --git a/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb b/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb
index cfeb42c..2ca673b 100644
--- a/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb
+++ b/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb
@@ -1,6 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
-# #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1)
-# #2023_11_24_Time_58_ms_(97.65%)_Space_211.4_MB_(74.12%)
+# #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
+# #Big_O_Time_O(N)_Space_O(1) #2023_11_24_Time_58_ms_(97.65%)_Space_211.4_MB_(74.12%)
 
 # @param {ListNode} head
 # @return {Boolean}
diff --git a/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb b/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb
index 53099c9..43bbbf3 100644
--- a/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb
+++ b/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List
-# #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity)
-# #2023_11_24_Time_290_ms_(78.05%)_Space_253.1_MB_(69.92%)
+# #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
+# #Big_O_Time_O(1)_Space_O(capacity) #2023_11_24_Time_290_ms_(78.05%)_Space_253.1_MB_(69.92%)
 
 class LRUCache
   class LruCacheNode
diff --git a/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb b/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb
index 34f43b0..a829121 100644
--- a/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb
+++ b/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List
-# #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N))
-# #2023_11_24_Time_188_ms_(84.21%)_Space_224_MB_(21.05%)
+# #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer
+# #Big_O_Time_O(log(N))_Space_O(log(N)) #2023_11_24_Time_188_ms_(84.21%)_Space_224_MB_(21.05%)
 
 require_relative '../../com_github_leetcode/list_node'
 
diff --git a/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb b/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb
index 47d5133..6179e5a 100644
--- a/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb
+++ b/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
-# #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N)
-# #2023_11_24_Time_58_ms_(78.74%)_Space_211.1_MB_(78.74%)
+# #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search
+# #Big_O_Time_O(log_N)_Space_O(log_N) #2023_11_24_Time_58_ms_(78.74%)_Space_211.1_MB_(78.74%)
 
 # @param {Integer[]} nums
 # @return {Integer}
diff --git a/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb b/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb
index 97da36e..d2a21ed 100644
--- a/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb
+++ b/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb
@@ -1,6 +1,7 @@
-# #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) #2023_11_24_Time_76_ms_(79.40%)_Space_215.2_MB_(6.53%)
+# #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N)
+# #2023_11_24_Time_76_ms_(79.40%)_Space_215.2_MB_(6.53%)
 
 # @param {String} string
 # @return {String}
diff --git a/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb b/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb
index 5d53443..275ee01 100644
--- a/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb
+++ b/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb
@@ -1,6 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting
 # #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm
-# #Big_O_Time_O(n)_Space_O(1) #2023_11_24_Time_75_ms_(64.60%)_Space_212.5_MB_(31.42%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+# #2023_11_24_Time_75_ms_(64.60%)_Space_212.5_MB_(31.42%)
 
 # @param {Integer[]} nums
 # @return {Integer}
diff --git a/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb b/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb
index 3e7aead..5ffc80a 100644
--- a/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb
+++ b/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers
-# #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
-# #2023_11_24_Time_100_ms_(92.40%)_Space_218.6_MB_(81.37%)
+# #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String
+# #Big_O_Time_O(n)_Space_O(1) #2023_11_24_Time_100_ms_(92.40%)_Space_218.6_MB_(81.37%)
 
 # @param {Integer[]} nums
 # @param {Integer} k
diff --git a/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb b/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb
index 21f34d5..e85123c 100644
--- a/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb
+++ b/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
-# #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
-# #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n)
-# #2023_11_25_Time_41_ms_(99.28%)_Space_210.9_MB_(86.23%)
+# #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
+# #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
+# #Big_O_Time_O(n)_Space_O(n) #2023_11_25_Time_41_ms_(99.28%)_Space_210.9_MB_(86.23%)
 
 # @param {Integer[]} nums
 # @return {Integer}
diff --git a/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb b/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb
index c9fcb53..3dbaedf 100644
--- a/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb
+++ b/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb
@@ -2,7 +2,8 @@
 # #Breadth_First_Search #Matrix #Union_Find
 # #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search
 # #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph
-# #Big_O_Time_O(M*N)_Space_O(M*N) #2023_11_25_Time_141_ms_(72.68%)_Space_219.4_MB_(87.43%)
+# #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N)
+# #2023_11_25_Time_141_ms_(72.68%)_Space_219.4_MB_(87.43%)
 
 # @param {Character[][]} grid
 # @return {Integer}
diff --git a/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb b/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb
index 1e4409a..0e326a8 100644
--- a/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb
+++ b/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
-# #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
-# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1)
-# #2023_11_25_Time_52_ms_(93.99%)_Space_211.1_MB_(64.56%)
+# #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List
+# #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List
+# #Big_O_Time_O(N)_Space_O(1) #2023_11_25_Time_52_ms_(93.99%)_Space_211.1_MB_(64.56%)
 
 # Definition for singly-linked list.
 # class ListNode
diff --git a/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb b/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb
index 6ae896f..92cba31 100644
--- a/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb
+++ b/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search
-# #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N)
-# #2023_11_25_Time_60_ms_(95.42%)_Space_212.4_MB_(26.72%)
+# #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General
+# #Big_O_Time_O(N)_Space_O(N) #2023_11_25_Time_60_ms_(95.42%)_Space_212.4_MB_(26.72%)
 
 WHITE = 0
 GRAY = 1
diff --git a/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb b/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb
index 2a47b4c..7ffdc84 100644
--- a/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb
+++ b/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb
@@ -1,5 +1,5 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
-# #Level_2_Day_16_Design #Udemy_Trie_and_Heap
+# #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
 # #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)
 # #2023_11_25_Time_167_ms_(69.81%)_Space_227_MB_(33.96%)
 
diff --git a/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb b/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb
index 998d38c..10b7519 100644
--- a/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb
+++ b/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb
@@ -1,5 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
-# #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue
+# #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue
+# #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
 # #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2023_11_25_Time_123_ms_(93.55%)_Space_219.4_MB_(80.65%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb b/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb
index a8732b7..5b42684 100644
--- a/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb
+++ b/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb
@@ -1,5 +1,5 @@
-# #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
-# #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n)
+# #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
+# #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n)
 # #2023_11_25_Time_184_ms_(80.00%)_Space_221.3_MB_(70.00%)
 
 # @param {Character[][]} matrix
diff --git a/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb b/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb
index 6ee541c..2768550 100644
--- a/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb
+++ b/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb
@@ -1,6 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
 # #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue
-# #Big_O_Time_O(n)_Space_O(n) #2023_11_25_Time_54_ms_(89.43%)_Space_210.9_MB_(84.58%)
+# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
+# #2023_11_25_Time_54_ms_(89.43%)_Space_210.9_MB_(84.58%)
 
 # Definition for a binary tree node.
 # class TreeNode
diff --git a/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb b/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb
index c9668f3..5973e3c 100644
--- a/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb
+++ b/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb
@@ -1,6 +1,7 @@
-# #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) #2023_11_25_Time_68_ms_(89.41%)_Space_212.6_MB_(57.65%)
+# #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
+# #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
+# #2023_11_25_Time_68_ms_(89.41%)_Space_212.6_MB_(57.65%)
 
 # Definition for a binary tree node.
 # class TreeNode
diff --git a/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb b/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb
index f760819..273a8fb 100644
--- a/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb
+++ b/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb
@@ -1,5 +1,5 @@
-# #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)
 # #2023_11_25_Time_297_ms_(78.26%)_Space_219.7_MB_(94.57%)
 
 require_relative '../../com_github_leetcode/list_node'
diff --git a/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb b/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb
index 810e7fc..f69377b 100644
--- a/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb
+++ b/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb
@@ -1,5 +1,6 @@
-# #Medium #Top_100_Liked_Questions #Top_Interview_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)
+# #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
+# #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
+# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
 # #2023_11_26_Time_75_ms_(86.57%)_Space_213.7_MB_(77.61%)
 
 # Definition for a binary tree node.
diff --git a/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb b/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb
index 439b2d7..88256e2 100644
--- a/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb
+++ b/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb
@@ -1,6 +1,6 @@
-# #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)
-# #2023_11_26_Time_123_ms_(76.59%)_Space_219.2_MB_(46.83%)
+# #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String
+# #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String
+# #Big_O_Time_O(n^2)_Space_O(n) #2023_11_26_Time_123_ms_(76.59%)_Space_219.2_MB_(46.83%)
 
 # @param {Integer[]} nums
 # @return {Integer[]}
diff --git a/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb b/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb
index 1f932d1..b591787 100644
--- a/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb
+++ b/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb
@@ -1,5 +1,5 @@
-# #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)
 # #2023_11_26_Time_511_ms_(77.78%)_Space_238.5_MB_(66.67%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb b/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb
index 7e110ed..8a340ec 100644
--- a/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb
+++ b/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb
@@ -1,6 +1,6 @@
-# #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) #2023_11_26_Time_154_ms_(100.00%)_Space_214.9_MB_(37.50%)
+# #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)
+# #2023_11_26_Time_154_ms_(100.00%)_Space_214.9_MB_(37.50%)
 
 # @param {Integer[][]} matrix
 # @param {Integer} target
diff --git a/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb b/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb
index e6c923c..9e3f91e 100644
--- a/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb
+++ b/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb
@@ -1,4 +1,4 @@
-# #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers
+# #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers
 # #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
 # #Big_O_Time_O(n)_Space_O(1) #2023_11_26_Time_95_ms_(78.01%)_Space_212.9_MB_(32.46%)
 
diff --git a/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb b/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb
index 8bfa94e..cf0a597 100644
--- a/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb
+++ b/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb
@@ -1,5 +1,5 @@
-# #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)
 # #2023_11_26_Time_107_ms_(81.25%)_Space_222.8_MB_(31.25%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb b/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb
index 21d65af..79e2691 100644
--- a/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb
+++ b/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb
@@ -1,5 +1,5 @@
-# #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)
+# #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
+# #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n)
 # #2023_11_26_Time_314_ms_(95.00%)_Space_229.3_MB_(70.00%)
 
 class MedianFinder
diff --git a/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb b/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb
index 270c4b0..17498f8 100644
--- a/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb
+++ b/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb
@@ -1,6 +1,6 @@
-# #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 #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n)
 # #2023_11_26_Time_68_ms_(96.55%)_Space_211.5_MB_(31.03%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb b/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb
index 679c63b..6344050 100644
--- a/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb
+++ b/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb
@@ -1,6 +1,6 @@
-# #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
-# #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount)
+# #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 #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount)
 # #2023_11_26_Time_655_ms_(84.96%)_Space_217.7_MB_(39.82%)
 
 # @param {Integer[]} coins
diff --git a/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb b/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb
index 560bd72..8af3807 100644
--- a/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb
+++ b/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb
@@ -1,5 +1,6 @@
-# #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
-# #Big_O_Time_O(num)_Space_O(num) #2023_11_26_Time_90_ms_(96.34%)_Space_215.9_MB_(60.98%)
+# #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
+# #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
+# #2023_11_26_Time_90_ms_(96.34%)_Space_215.9_MB_(60.98%)
 
 # @param {Integer} num
 # @return {Integer[]}
diff --git a/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb b/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb
index f91a150..859958d 100644
--- a/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb
+++ b/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb
@@ -1,7 +1,6 @@
-# #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)
-# #2023_11_27_Time_67_ms_(83.85%)_Space_212_MB_(84.54%)
+# #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) #2023_11_27_Time_67_ms_(83.85%)_Space_212_MB_(84.54%)
 
 # @param {Integer[]} nums
 # @param {Integer} k
diff --git a/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb b/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb
index 93e7b61..40e7a84 100644
--- a/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb
+++ b/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb
@@ -1,5 +1,6 @@
-# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
-# #Big_O_Time_O(n)_Space_O(n) #2023_11_27_Time_58_ms_(84.09%)_Space_211.1_MB_(40.91%)
+# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack
+# #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
+# #2023_11_27_Time_58_ms_(84.09%)_Space_211.1_MB_(40.91%)
 
 # @param {String} s
 # @return {String}
diff --git a/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb b/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb
index f015455..f8bd10f 100644
--- a/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb
+++ b/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb
@@ -1,4 +1,4 @@
-# #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
+# #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree
 # #Big_O_Time_O(n)_Space_O(n) #2023_11_27_Time_205_ms_(61.54%)_Space_226.5_MB_(53.85%)
 
 # Definition for a binary tree node.
diff --git a/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb b/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb
index 423a367..8b2e258 100644
--- a/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb
+++ b/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb
@@ -1,5 +1,4 @@
-# #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))
 # #2023_11_27_Time_149_ms_(76.92%)_Space_211.8_MB_(100.00%)
 
 # @param {Integer[]} nums
diff --git a/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb b/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb
index 9705e67..57c3ec7 100644
--- a/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb
+++ b/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb
@@ -1,4 +1,4 @@
-# #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)
 # #2023_11_27_Time_101_ms_(100.00%)_Space_211.2_MB_(28.57%)
 
 # @param {String} s
diff --git a/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb b/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb
index 92877d8..2e06bf1 100644
--- a/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb
+++ b/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb
@@ -1,5 +1,6 @@
-# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
-# #Big_O_Time_O(n)_Space_O(n) #2023_11_27_Time_490_ms_(84.71%)_Space_233.3_MB_(18.82%)
+# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack
+# #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n)
+# #2023_11_27_Time_490_ms_(84.71%)_Space_233.3_MB_(18.82%)
 
 # @param {Integer[]} temperatures
 # @return {Integer[]}
diff --git a/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb b/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb
index 9f70579..005c8af 100644
--- a/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb
+++ b/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb
@@ -1,6 +1,5 @@
-# #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)
-# #2023_11_27_Time_62_ms_(100.00%)_Space_210.9_MB_(100.00%)
+# #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
+# #Big_O_Time_O(n)_Space_O(1) #2023_11_27_Time_62_ms_(100.00%)_Space_210.9_MB_(100.00%)
 
 # @param {String} s
 # @return {Integer[]}
diff --git a/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb b/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb
index 9988eb4..4f1ee76 100644
--- a/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb
+++ b/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb
@@ -1,4 +1,4 @@
-# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
+# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
 # #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19
 # #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m)
 # #2023_11_27_Time_828_ms_(75.00%)_Space_235.1_MB_(56.82%)