javadev · javadev · Jan 29, 2025 · Jan 29, 2025
diff --git a/README.md b/README.md
diff --git a/src/main/java/g0001_0100/s0001_two_sum/Solution.java b/src/main/java/g0001_0100/s0001_two_sum/Solution.java
@@ -1,8 +1,9 @@
 package g0001_0100.s0001_two_sum;
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
-// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
-// #AI_can_be_used_to_solve_the_task #2024_11_09_Time_2_ms_(98.90%)_Space_44.9_MB_(47.05%)
+// #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_11_09_Time_2_ms_(98.90%)_Space_44.9_MB_(47.05%)
 
 import java.util.HashMap;
 import java.util.Map;

diff --git a/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java b/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
@@ -2,8 +2,8 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
 // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
-// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #AI_can_be_used_to_solve_the_task
-// #2024_11_09_Time_1_ms_(100.00%)_Space_43.7_MB_(99.52%)
+// #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_11_09_Time_1_ms_(100.00%)_Space_43.7_MB_(99.52%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java b/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
@@ -2,7 +2,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) #AI_can_be_used_to_solve_the_task
+// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
 // #2024_11_09_Time_2_ms_(98.59%)_Space_43.4_MB_(90.39%)
 
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java b/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java
@@ -1,8 +1,8 @@
 package g0001_0100.s0004_median_of_two_sorted_arrays;
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
-// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #AI_can_be_used_to_solve_the_task
-// #2024_11_09_Time_1_ms_(100.00%)_Space_46.1_MB_(40.80%)
+// #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_11_09_Time_1_ms_(100.00%)_Space_46.1_MB_(40.80%)
 
 @SuppressWarnings("java:S2234")
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java b/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
@@ -2,8 +2,8 @@
 
 // #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_11_09_Time_7_ms_(97.82%)_Space_43_MB_(66.41%)
+// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
+// #Big_O_Time_O(n)_Space_O(n) #2024_11_09_Time_7_ms_(97.82%)_Space_43_MB_(66.41%)
 
 public class Solution {
     public String longestPalindrome(String s) {

diff --git a/src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java b/src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0006_zigzag_conversion;
 
-// #Medium #String #2024_11_17_Time_2_ms_(99.71%)_Space_44.5_MB_(94.69%)
+// #Medium #String #Top_Interview_150_Array/String
+// #2024_11_17_Time_2_ms_(99.71%)_Space_44.5_MB_(94.69%)
 
 public class Solution {
     public String convert(String s, int numRows) {

diff --git a/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java b/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0009_palindrome_number;
 
-// #Easy #Math #Udemy_Integers #2024_11_09_Time_4_ms_(100.00%)_Space_44.1_MB_(28.20%)
+// #Easy #Math #Udemy_Integers #Top_Interview_150_Math
+// #2024_11_09_Time_4_ms_(100.00%)_Space_44.1_MB_(28.20%)
 
 public class Solution {
     public boolean isPalindrome(int x) {

diff --git a/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java b/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0011_container_with_most_water;
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
-// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
+// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
 // #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%)
 
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java b/src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0012_integer_to_roman;
 
-// #Medium #String #Hash_Table #Math #2024_02_11_Time_2_ms_(100.00%)_Space_44.1_MB_(80.61%)
+// #Medium #String #Hash_Table #Math #Top_Interview_150_Array/String
+// #2024_02_11_Time_2_ms_(100.00%)_Space_44.1_MB_(80.61%)
 
 public class Solution {
     public String intToRoman(int num) {

diff --git a/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java b/src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0013_roman_to_integer;
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
-// #2024_02_11_Time_2_ms_(100.00%)_Space_44.5_MB_(76.62%)
+// #Top_Interview_150_Array/String #2024_02_11_Time_2_ms_(100.00%)_Space_44.5_MB_(76.62%)
 
 public class Solution {
     public int romanToInt(String s) {

diff --git a/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java b/src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java
@@ -1,7 +1,8 @@
 package g0001_0100.s0014_longest_common_prefix;
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String
-// #Udemy_Strings #2024_02_11_Time_0_ms_(100.00%)_Space_42_MB_(19.08%)
+// #Udemy_Strings #Top_Interview_150_Array/String
+// #2024_02_11_Time_0_ms_(100.00%)_Space_42_MB_(19.08%)
 
 public class Solution {
     public String longestCommonPrefix(String[] strs) {

diff --git a/src/main/java/g0001_0100/s0015_3sum/Solution.java b/src/main/java/g0001_0100/s0015_3sum/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_09_Time_29_ms_(72.02%)_Space_52_MB_(33.13%)
+// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
+// #2024_11_09_Time_29_ms_(72.02%)_Space_52_MB_(33.13%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java b/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%)
+// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
+// #2024_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%)
 
 import java.util.ArrayList;
 import java.util.Collections;

diff --git a/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java b/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java
@@ -1,8 +1,8 @@
 package g0001_0100.s0019_remove_nth_node_from_end_of_list;
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List
-// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
-// #2024_11_09_Time_0_ms_(100.00%)_Space_41.4_MB_(87.28%)
+// #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_11_09_Time_0_ms_(100.00%)_Space_41.4_MB_(87.28%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java b/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java
@@ -1,8 +1,8 @@
 package g0001_0100.s0020_valid_parentheses;
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
-// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
-// #2024_11_09_Time_2_ms_(97.19%)_Space_41.8_MB_(17.32%)
+// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
+// #Big_O_Time_O(n)_Space_O(n) #2024_11_09_Time_2_ms_(97.19%)_Space_41.8_MB_(17.32%)
 
 import java.util.Stack;
 

diff --git a/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java b/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
@@ -2,8 +2,8 @@
 
 // #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_11_09_Time_0_ms_(100.00%)_Space_43_MB_(5.04%)
+// #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_11_09_Time_0_ms_(100.00%)_Space_43_MB_(5.04%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java b/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_10_Time_0_ms_(100.00%)_Space_42.8_MB_(84.67%)
+// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_42.8_MB_(84.67%)
 
 import java.util.ArrayList;
 import java.util.List;

diff --git a/src/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java b/src/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java
@@ -1,8 +1,8 @@
 package g0001_0100.s0023_merge_k_sorted_lists;
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
-// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
-// #2024_11_10_Time_1_ms_(99.86%)_Space_44.1_MB_(79.93%)
+// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer
+// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_11_10_Time_1_ms_(99.86%)_Space_44.1_MB_(79.93%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java b/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0025_reverse_nodes_in_k_group;
 
 // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
-// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
+// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k)
 // #2024_11_10_Time_0_ms_(100.00%)_Space_44.4_MB_(33.90%)
 
 import com_github_leetcode.ListNode;

diff --git a/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java b/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0026_remove_duplicates_from_sorted_array;
 
 // #Easy #Top_Interview_Questions #Array #Two_Pointers #Udemy_Two_Pointers
-// #2023_08_09_Time_1_ms_(98.56%)_Space_43.9_MB_(51.95%)
+// #Top_Interview_150_Array/String #2023_08_09_Time_1_ms_(98.56%)_Space_43.9_MB_(51.95%)
 
 public class Solution {
     public int removeDuplicates(int[] nums) {

diff --git a/src/main/java/g0001_0100/s0027_remove_element/Solution.java b/src/main/java/g0001_0100/s0027_remove_element/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0027_remove_element;
 
-// #Easy #Array #Two_Pointers #2023_08_09_Time_0_ms_(100.00%)_Space_40.9_MB_(87.68%)
+// #Easy #Array #Two_Pointers #Top_Interview_150_Array/String
+// #2023_08_09_Time_0_ms_(100.00%)_Space_40.9_MB_(87.68%)
 
 public class Solution {
     public int removeElement(int[] nums, int val) {

diff --git a/...in/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java b/...in/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java
@@ -1,7 +1,8 @@
 package g0001_0100.s0028_find_the_index_of_the_first_occurrence_in_a_string;
 
 // #Easy #Top_Interview_Questions #String #Two_Pointers #String_Matching
-// #Programming_Skills_II_Day_1 #2023_08_09_Time_0_ms_(100.00%)_Space_40.5_MB_(71.14%)
+// #Programming_Skills_II_Day_1 #Top_Interview_150_Array/String
+// #2023_08_09_Time_0_ms_(100.00%)_Space_40.5_MB_(71.14%)
 
 public class Solution {
     public int strStr(String haystack, String needle) {

diff --git a/src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java b/src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0030_substring_with_concatenation_of_all_words;
 
-// #Hard #String #Hash_Table #Sliding_Window #2023_08_09_Time_1472_ms_(34.43%)_Space_45_MB_(24.98%)
+// #Hard #String #Hash_Table #Sliding_Window #Top_Interview_150_Sliding_Window
+// #2023_08_09_Time_1472_ms_(34.43%)_Space_45_MB_(24.98%)
 
 import java.util.ArrayList;
 import java.util.HashMap;

diff --git a/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java b/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
@@ -2,7 +2,7 @@
 
 // #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_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(21.10%)
 
 public class Solution {

diff --git a/...va/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java b/...va/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java
@@ -1,8 +1,8 @@
 package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array;
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
-// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
-// #2024_11_10_Time_0_ms_(100.00%)_Space_45.7_MB_(82.78%)
+// #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_11_10_Time_0_ms_(100.00%)_Space_45.7_MB_(82.78%)
 
 public class Solution {
     public int[] searchRange(int[] nums, int target) {

diff --git a/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java b/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0035_search_insert_position;
 
 // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
-// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
+// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
 // #2024_11_10_Time_0_ms_(100.00%)_Space_43_MB_(40.42%)
 
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java b/src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0036_valid_sudoku;
 
 // #Medium #Top_Interview_Questions #Array #Hash_Table #Matrix #Data_Structure_I_Day_5_Array
-// #2023_08_09_Time_1_ms_(100.00%)_Space_43.8_MB_(30.47%)
+// #Top_Interview_150_Matrix #2023_08_09_Time_1_ms_(100.00%)_Space_43.8_MB_(30.47%)
 
 public class Solution {
     private int j1;

diff --git a/src/main/java/g0001_0100/s0039_combination_sum/Solution.java b/src/main/java/g0001_0100/s0039_combination_sum/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_10_Time_1_ms_(99.99%)_Space_44.5_MB_(51.73%)
+// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
+// #2024_11_10_Time_1_ms_(99.99%)_Space_44.5_MB_(51.73%)
 
 import java.util.ArrayList;
 import java.util.List;

diff --git a/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java b/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_10_Time_0_ms_(100.00%)_Space_46.2_MB_(57.86%)
+// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_46.2_MB_(57.86%)
 
 public class Solution {
     public int trap(int[] height) {

diff --git a/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java b/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_10_Time_0_ms_(100.00%)_Space_45_MB_(64.44%)
+// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_45_MB_(64.44%)
 
 public class Solution {
     private int getMax(int[] nums, int l, int r) {

diff --git a/src/main/java/g0001_0100/s0046_permutations/Solution.java b/src/main/java/g0001_0100/s0046_permutations/Solution.java
@@ -2,7 +2,7 @@
 
 // #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_11_10_Time_1_ms_(94.08%)_Space_45.1_MB_(6.84%)
 
 import java.util.ArrayList;

diff --git a/src/main/java/g0001_0100/s0048_rotate_image/Solution.java b/src/main/java/g0001_0100/s0048_rotate_image/Solution.java
@@ -2,7 +2,8 @@
 
 // #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) #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(43.71%)
+// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(43.71%)
 
 public class Solution {
     public void rotate(int[][] matrix) {

diff --git a/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java b/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_11_Time_6_ms_(97.61%)_Space_47.7_MB_(69.56%)
+// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
+// #2024_11_11_Time_6_ms_(97.61%)_Space_47.7_MB_(69.56%)
 
 import java.util.ArrayList;
 import java.util.HashMap;

diff --git a/src/main/java/g0001_0100/s0050_powx_n/Solution.java b/src/main/java/g0001_0100/s0050_powx_n/Solution.java
@@ -1,6 +1,6 @@
 package g0001_0100.s0050_powx_n;
 
-// #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers
+// #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers #Top_Interview_150_Math
 // #2023_08_11_Time_0_ms_(100.00%)_Space_41.2_MB_(14.99%)
 
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java b/src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0052_n_queens_ii;
 
-// #Hard #Backtracking #2023_08_11_Time_1_ms_(96.99%)_Space_39.8_MB_(38.70%)
+// #Hard #Backtracking #Top_Interview_150_Backtracking #Top_Interview_150_Kadane's_Algorithm
+// #2023_08_11_Time_1_ms_(96.99%)_Space_39.8_MB_(38.70%)
 
 public class Solution {
     public int totalNQueens(int n) {

diff --git a/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java b/src/main/java/g0001_0100/s0054_spiral_matrix/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Simulation
 // #Programming_Skills_II_Day_8 #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
-// #2023_08_11_Time_0_ms_(100.00%)_Space_41_MB_(9.67%)
+// #Top_Interview_150_Matrix #2023_08_11_Time_0_ms_(100.00%)_Space_41_MB_(9.67%)
 
 import java.util.ArrayList;
 import java.util.List;

diff --git a/src/main/java/g0001_0100/s0055_jump_game/Solution.java b/src/main/java/g0001_0100/s0055_jump_game/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_11_Time_1_ms_(100.00%)_Space_45.6_MB_(44.48%)
+// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
+// #2024_11_11_Time_1_ms_(100.00%)_Space_45.6_MB_(44.48%)
 
 public class Solution {
     public boolean canJump(int[] nums) {

diff --git a/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java b/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java
@@ -2,7 +2,8 @@
 
 // #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_11_11_Time_7_ms_(98.37%)_Space_46.8_MB_(11.43%)
+// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
+// #2024_11_11_Time_7_ms_(98.37%)_Space_46.8_MB_(11.43%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g0001_0100/s0057_insert_interval/Solution.java b/src/main/java/g0001_0100/s0057_insert_interval/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0057_insert_interval;
 
-// #Medium #Array #Level_2_Day_17_Interval #2023_08_11_Time_0_ms_(100.00%)_Space_43.7_MB_(95.60%)
+// #Medium #Array #Level_2_Day_17_Interval #Top_Interview_150_Intervals
+// #2023_08_11_Time_0_ms_(100.00%)_Space_43.7_MB_(95.60%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java b/src/main/java/g0001_0100/s0058_length_of_last_word/Solution.java
@@ -1,6 +1,6 @@
 package g0001_0100.s0058_length_of_last_word;
 
-// #Easy #String #Programming_Skills_II_Day_6 #Udemy_Arrays
+// #Easy #String #Programming_Skills_II_Day_6 #Udemy_Arrays #Top_Interview_150_Array/String
 // #2023_08_11_Time_0_ms_(100.00%)_Space_40.3_MB_(97.60%)
 
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0061_rotate_list/Solution.java b/src/main/java/g0001_0100/s0061_rotate_list/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0061_rotate_list;
 
 // #Medium #Two_Pointers #Linked_List #Programming_Skills_II_Day_16 #Udemy_Linked_List
-// #2023_08_11_Time_0_ms_(100.00%)_Space_41.1_MB_(94.89%)
+// #Top_Interview_150_Linked_List #2023_08_11_Time_0_ms_(100.00%)_Space_41.1_MB_(94.89%)
 
 import com_github_leetcode.ListNode;