LeetCode-in-Elixir · javadev · Jun 22, 2025 · Jun 22, 2025
diff --git a/README.md b/README.md
diff --git a/src/main/elixir/g0001_0100/s0001_two_sum/Solution.ex b/src/main/elixir/g0001_0100/s0001_two_sum/Solution.ex
@@ -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
 # #2024_07_06_Time_261_ms_(94.89%)_Space_77.3_MB_(46.59%)
 
 defmodule Solution do

diff --git a/src/main/elixir/g0001_0100/s0002_add_two_numbers/Solution.ex b/src/main/elixir/g0001_0100/s0002_add_two_numbers/Solution.ex
@@ -1,6 +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)) #2024_07_06_Time_353_ms_(88.68%)_Space_72.6_MB_(9.43%)
+# #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 #2024_07_06_Time_353_ms_(88.68%)_Space_72.6_MB_(9.43%)
 
 # Definition for singly-linked list.
 #

diff --git a/src/main/elixir/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.ex b/src/main/elixir/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.ex
@@ -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) #2024_07_06_Time_356_ms_(93.33%)_Space_84.7_MB_(8.89%)
+# #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
+# #2024_07_06_Time_356_ms_(93.33%)_Space_84.7_MB_(8.89%)
 
 defmodule Solution do
   @spec length_of_longest_substring(s :: String.t()) :: integer

diff --git a/src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.ex b/src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.ex
@@ -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) #2024_07_06_Time_474_ms_(86.21%)_Space_75.1_MB_(55.17%)
+# #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
+# #AI_can_be_used_to_solve_the_task #2024_07_06_Time_474_ms_(86.21%)_Space_75.1_MB_(55.17%)
 
 defmodule Solution do
   @spec find_median_sorted_arrays(nums1 :: [integer], nums2 :: [integer]) :: float

diff --git a/src/main/elixir/g0001_0100/s0005_longest_palindromic_substring/Solution.ex b/src/main/elixir/g0001_0100/s0005_longest_palindromic_substring/Solution.ex
@@ -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)
-# #2024_07_06_Time_337_ms_(100.00%)_Space_72.9_MB_(85.71%)
+# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
+# #Big_O_Time_O(n)_Space_O(n) #2024_07_06_Time_337_ms_(100.00%)_Space_72.9_MB_(85.71%)
 
 defmodule Solution do
   @spec longest_palindrome(s :: String.t()) :: String.t()

diff --git a/src/main/elixir/g0001_0100/s0006_zigzag_conversion/Solution.ex b/src/main/elixir/g0001_0100/s0006_zigzag_conversion/Solution.ex
@@ -1,4 +1,5 @@
-# #Medium #String #2024_07_31_Time_421_ms_(100.00%)_Space_73.2_MB_(100.00%)
+# #Medium #String #Top_Interview_150_Array/String
+# #2024_07_31_Time_421_ms_(100.00%)_Space_73.2_MB_(100.00%)
 
 defmodule Solution do
   @spec convert(s :: String.t, num_rows :: integer) :: String.t

diff --git a/src/main/elixir/g0001_0100/s0009_palindrome_number/Solution.ex b/src/main/elixir/g0001_0100/s0009_palindrome_number/Solution.ex
@@ -1,4 +1,5 @@
-# #Easy #Math #Udemy_Integers #2024_07_31_Time_1007_ms_(87.50%)_Space_72_MB_(33.93%)
+# #Easy #Math #Udemy_Integers #Top_Interview_150_Math
+# #2024_07_31_Time_1007_ms_(87.50%)_Space_72_MB_(33.93%)
 
 defmodule Solution do
   @spec is_palindrome(x :: integer) :: boolean

diff --git a/src/main/elixir/g0001_0100/s0011_container_with_most_water/Solution.ex b/src/main/elixir/g0001_0100/s0011_container_with_most_water/Solution.ex
@@ -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)
-# #2024_07_31_Time_620_ms_(93.33%)_Space_137.1_MB_(6.67%)
+# #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
+# #Big_O_Time_O(n)_Space_O(1) #2024_07_31_Time_620_ms_(93.33%)_Space_137.1_MB_(6.67%)
 
 defmodule Solution do
   @spec max_area(height :: [integer]) :: integer

diff --git a/src/main/elixir/g0001_0100/s0015_3sum/Solution.ex b/src/main/elixir/g0001_0100/s0015_3sum/Solution.ex
@@ -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) #2024_07_31_Time_717_ms_(100.00%)_Space_78.5_MB_(100.00%)
+# #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
+# #2024_07_31_Time_717_ms_(100.00%)_Space_78.5_MB_(100.00%)
 
 defmodule Solution do
   @spec three_sum(nums :: [integer]) :: [[integer]]

diff --git a/src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.ex b/src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.ex
@@ -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) #2024_07_31_Time_279_ms_(100.00%)_Space_72_MB_(100.00%)
+# #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)
+# #2024_07_31_Time_279_ms_(100.00%)_Space_72_MB_(100.00%)
 
 defmodule Solution do
   @t9 (Enum.chunk_every(?a..?o, 3) ++ [~c"pqrs", ~c"tuv", ~c"wxyz"])

diff --git a/src/main/elixir/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.ex b/src/main/elixir/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.ex
@@ -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)
-# #2024_07_31_Time_275_ms_(100.00%)_Space_72_MB_(33.33%)
+# #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) #2024_07_31_Time_275_ms_(100.00%)_Space_72_MB_(33.33%)
 
 # Definition for singly-linked list.
 #

diff --git a/src/main/elixir/g0001_0100/s0020_valid_parentheses/Solution.ex b/src/main/elixir/g0001_0100/s0020_valid_parentheses/Solution.ex
@@ -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)
-# #2024_07_31_Time_252_ms_(81.48%)_Space_71.9_MB_(77.78%)
+# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
+# #Big_O_Time_O(n)_Space_O(n) #2024_07_31_Time_252_ms_(81.48%)_Space_71.9_MB_(77.78%)
 
 defmodule Solution do
 

diff --git a/src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists/Solution.ex b/src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists/Solution.ex
@@ -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)
-# #2024_07_31_Time_261_ms_(85.00%)_Space_71.9_MB_(40.00%)
+# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
+# #Big_O_Time_O(m+n)_Space_O(m+n) #2024_07_31_Time_261_ms_(85.00%)_Space_71.9_MB_(40.00%)
 
 # Definition for singly-linked list.
 #

diff --git a/src/main/elixir/g0001_0100/s0022_generate_parentheses/Solution.ex b/src/main/elixir/g0001_0100/s0022_generate_parentheses/Solution.ex
@@ -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) #2024_07_31_Time_229_ms_(100.00%)_Space_71.5_MB_(100.00%)
+# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
+# #2024_07_31_Time_229_ms_(100.00%)_Space_71.5_MB_(100.00%)
 
 defmodule Solution do
   @spec generate_parenthesis(n :: integer) :: [String.t()]

diff --git a/src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists/Solution.ex b/src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists/Solution.ex
@@ -1,5 +1,6 @@
-# #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)
+# #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))
 # #2024_07_31_Time_215_ms_(100.00%)_Space_72.1_MB_(33.33%)
 
 # Definition for singly-linked list.

diff --git a/src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.ex b/src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.ex
@@ -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)
 # #2024_07_31_Time_237_ms_(100.00%)_Space_74.4_MB_(50.00%)
 
 # Definition for singly-linked list.

diff --git a/src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.ex b/src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.ex
@@ -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)
 # #2024_08_02_Time_292_ms_(100.00%)_Space_73.4_MB_(100.00%)
 
 defmodule Solution do

diff --git a/...ixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.ex b/...ixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.ex
@@ -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)
-# #2024_08_02_Time_1249_ms_(100.00%)_Space_110.3_MB_(100.00%)
+# #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) #2024_08_02_Time_1249_ms_(100.00%)_Space_110.3_MB_(100.00%)
 
 defmodule Solution do
   @spec search_range(nums :: [integer], target :: integer) :: [integer]

diff --git a/src/main/elixir/g0001_0100/s0035_search_insert_position/Solution.ex b/src/main/elixir/g0001_0100/s0035_search_insert_position/Solution.ex
@@ -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)
 # #2024_08_02_Time_228_ms_(100.00%)_Space_76.9_MB_(40.00%)
 
 defmodule Solution do

diff --git a/src/main/elixir/g0001_0100/s0039_combination_sum/Solution.ex b/src/main/elixir/g0001_0100/s0039_combination_sum/Solution.ex
@@ -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) #2024_08_02_Time_264_ms_(100.00%)_Space_71.9_MB_(66.67%)
+# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
+# #2024_08_02_Time_264_ms_(100.00%)_Space_71.9_MB_(66.67%)
 
 defmodule Solution do
   @spec combination_sum(candidates :: [integer], target :: integer) :: [[integer]]

diff --git a/src/main/elixir/g0001_0100/s0042_trapping_rain_water/Solution.ex b/src/main/elixir/g0001_0100/s0042_trapping_rain_water/Solution.ex
@@ -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) #2024_08_02_Time_280_ms_(100.00%)_Space_84.3_MB_(100.00%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+# #2024_08_02_Time_280_ms_(100.00%)_Space_84.3_MB_(100.00%)
 
 defmodule Solution do
   @spec trap(h :: [integer]) :: integer

diff --git a/src/main/elixir/g0001_0100/s0045_jump_game_ii/Solution.ex b/src/main/elixir/g0001_0100/s0045_jump_game_ii/Solution.ex
@@ -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) #2024_08_02_Time_299_ms_(100.00%)_Space_79.2_MB_(33.33%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+# #2024_08_02_Time_299_ms_(100.00%)_Space_79.2_MB_(33.33%)
 
 defmodule Solution do
   @spec jump(nums :: [integer]) :: integer

diff --git a/src/main/elixir/g0001_0100/s0046_permutations/Solution.ex b/src/main/elixir/g0001_0100/s0046_permutations/Solution.ex
@@ -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!)
 # #2024_08_02_Time_225_ms_(100.00%)_Space_71.8_MB_(100.00%)
 
 defmodule Solution do

diff --git a/src/main/elixir/g0001_0100/s0049_group_anagrams/Solution.ex b/src/main/elixir/g0001_0100/s0049_group_anagrams/Solution.ex
@@ -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) #2024_08_02_Time_339_ms_(66.67%)_Space_88_MB_(66.67%)
+# #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
+# #2024_08_02_Time_339_ms_(66.67%)_Space_88_MB_(66.67%)
 
 defmodule Solution do
   @spec group_anagrams(strs :: [String.t]) :: [[String.t]]

diff --git a/src/main/elixir/g0001_0100/s0053_maximum_subarray/Solution.ex b/src/main/elixir/g0001_0100/s0053_maximum_subarray/Solution.ex
@@ -1,6 +1,6 @@
 # #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)
 # #2024_08_02_Time_920_ms_(100.00%)_Space_157.5_MB_(100.00%)
 
 defmodule Solution do

diff --git a/src/main/elixir/g0001_0100/s0055_jump_game/Solution.ex b/src/main/elixir/g0001_0100/s0055_jump_game/Solution.ex
@@ -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) #2024_08_02_Time_437_ms_(100.00%)_Space_89.3_MB_(69.23%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+# #2024_08_02_Time_437_ms_(100.00%)_Space_89.3_MB_(69.23%)
 
 defmodule Solution do
   @spec can_jump(nums :: [integer]) :: boolean

diff --git a/src/main/elixir/g0001_0100/s0056_merge_intervals/Solution.ex b/src/main/elixir/g0001_0100/s0056_merge_intervals/Solution.ex
@@ -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) #2024_08_02_Time_305_ms_(100.00%)_Space_80.6_MB_(100.00%)
+# #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
+# #2024_08_02_Time_305_ms_(100.00%)_Space_80.6_MB_(100.00%)
 
 defmodule Solution do
   @spec merge(intervals :: [[integer]]) :: [[integer]]

diff --git a/src/main/elixir/g0001_0100/s0062_unique_paths/Solution.ex b/src/main/elixir/g0001_0100/s0062_unique_paths/Solution.ex
@@ -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)
-# #2024_08_02_Time_233_ms_(100.00%)_Space_71.9_MB_(66.67%)
+# #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) #2024_08_02_Time_233_ms_(100.00%)_Space_71.9_MB_(66.67%)
 
 defmodule Solution do
   @spec unique_paths(m :: integer, n :: integer) :: integer

diff --git a/src/main/elixir/g0001_0100/s0064_minimum_path_sum/Solution.ex b/src/main/elixir/g0001_0100/s0064_minimum_path_sum/Solution.ex
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
-# #Dynamic
97AE
_Programming_I_Day_16 #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
-# #2025_01_22_Time_3_(100.00%)_Space_89.73_(100.00%)
+# #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2025_01_22_Time_3_ms_(100.00%)_Space_89.73_MB_(100.00%)
 
 defmodule Solution do
   @spec min_path_sum(grid :: [[integer]]) :: integer

diff --git a/src/main/elixir/g0001_0100/s0070_climbing_stairs/Solution.ex b/src/main/elixir/g0001_0100/s0070_climbing_stairs/Solution.ex
@@ -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)
-# #2024_08_02_Time_255_ms_(100.00%)_Space_71.6_MB_(100.00%)
+# #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
+# #Big_O_Time_O(n)_Space_O(n) #2024_08_02_Time_255_ms_(100.00%)_Space_71.6_MB_(100.00%)
 
 defmodule Solution do
   @spec climb_stairs(n :: integer) :: integer

diff --git a/src/main/elixir/g0001_0100/s0072_edit_distance/Solution.ex b/src/main/elixir/g0001_0100/s0072_edit_distance/Solution.ex
@@ -1,6 +1,6 @@
-# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
+# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
 # #Algorithm_II_Day_18_Dynamic_Programmi
741A
ng #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)
 # #2024_08_02_Time_675_ms_(100.00%)_Space_164.7_MB_(100.00%)
 
 defmodule Solution do

diff --git a/src/main/elixir/g0001_0100/s0074_search_a_2d_matrix/Solution.ex b/src/main/elixir/g0001_0100/s0074_search_a_2d_matrix/Solution.ex
@@ -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)
 # #2024_08_02_Time_253_ms_(100.00%)_Space_74_MB_(100.00%)
 
 defmodule Solution do

diff --git a/src/main/elixir/g0001_0100/s0079_word_search/Solution.ex b/src/main/elixir/g0001_0100/s0079_word_search/Solution.ex
@@ -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)
-# #2024_08_03_Time_1312_ms_(100.00%)_Space_71.1_MB_(100.00%)
+# #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
+# #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_08_03_Time_1312_ms_(100.00%)_Space_71.1_MB_(100.00%)
 
 defmodule Solution do
   @spec exist(board :: [[char]], word :: String.t) :: boolean

diff --git a/src/main/elixir/g0001_0100/s0098_validate_binary_search_tree/Solution.ex b/src/main/elixir/g0001_0100/s0098_validate_binary_search_tree/Solution.ex
@@ -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))
 # #2024_08_03_Time_239_ms_(100.00%)_Space_82.9_MB_(33.33%)
 
 # Definition for a binary tree node.

diff --git a/src/main/elixir/g0101_0200/s0101_symmetric_tree/Solution.ex b/src/main/elixir/g0101_0200/s0101_symmetric_tree/Solution.ex
@@ -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)) #2024_08_03_Time_255_ms_(60.00%)_Space_72.3_MB_(100.00%)
+# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
+# #2024_08_03_Time_255_ms_(60.00%)_Space_72.3_MB_(100.00%)
 
 # Definition for a binary tree node.
 #

diff --git a/src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.ex b/src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.ex
@@ -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) #2024_08_03_Time_252_ms_(100.00%)_Space_74.9_MB_(33.33%)
+# #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N)
+# #2024_08_03_Time_252_ms_(100.00%)_Space_74.9_MB_(33.33%)
 
 # Definition for a binary tree node.
 #

diff --git a/src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.ex b/src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.ex
@@ -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) #2024_08_03_Time_254_ms_(100.00%)_Space_77.8_MB_(50.00%)
+# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
+# #2024_08_03_Time_254_ms_(100.00%)_Space_77.8_MB_(50.00%)
 
 # Definition for a binary tree node.
 #

diff --git a/...ir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.ex b/...ir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.ex
@@ -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)
-# #2024_08_03_Time_385_ms_(100.00%)_Space_75.6_MB_(50.00%)
+# #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General
+# #Big_O_Time_O(N)_Space_O(N) #2024_08_03_Time_385_ms_(100.00%)_Space_75.6_MB_(50.00%)
 
 # Definition for a binary tree node.
 #

diff --git a/src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.ex b/src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.ex
@@ -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) #2024_08_03_Time_797_ms_(30.00%)_Space_131.8_MB_(30.00%)
+# #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1)
+# #2024_08_03_Time_797_ms_(30.00%)_Space_131.8_MB_(30.00%)
 
 defmodule Solution do
   @spec max_profit(prices :: [integer]) :: integer

diff --git a/src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.ex b/src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.ex
@@ -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)
-# #2024_08_03_Time_291_ms_(100.00%)_Space_97.2_MB_(100.00%)
+# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
+# #Big_O_Time_O(N)_Space_O(N) #2024_08_03_Time_291_ms_(100.00%)_Space_97.2_MB_(100.00%)
 
 # Definition for a binary tree node.
 #

diff --git a/src/main/elixir/g0101_0200/s0128_longest_consecutive_sequence/Solution.ex b/src/main/elixir/g0101_0200/s0128_longest_consecutive_sequence/Solution.ex
@@ -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) #2024_08_03_Time_669_ms_(100.00%)_Space_208.6_MB_(85.71%)
+# #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1)
+# #2024_08_03_Time_669_ms_(100.00%)_Space_208.6_MB_(85.71%)
 
 defmodule Solution do
   @spec longest_consecutive(nums :: [integer]) :: integer

diff --git a/src/main/elixir/g0101_0200/s0136_single_number/Solution.ex b/src/main/elixir/g0101_0200/s0136_single_number/Solution.ex
@@ -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) #2024_08_03_Time_295_ms_(100.00%)_Space_84.9_MB_(85.71%)
 
 defmodule Solution do