LeetCode-in-Ruby · javadev · Jun 15, 2025 · Jun 15, 2025
diff --git a/README.md b/README.md
diff --git 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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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/...ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb b/...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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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
@@ -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/...by/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb b/...by/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
@@ -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.