javadev · javadev · Apr 13, 2025 · Apr 13, 2025 · Apr 13, 2025
diff --git a/README.md b/README.md
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,8 +1,8 @@
 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 #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%)
+// #LeetCode_75_Two_Pointers #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 {
     public int maxArea(int[] height) {

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
@@ -1,8 +1,8 @@
 package g0001_0100.s0017_letter_combinations_of_a_phone_number;
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
-// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
-// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
+// #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_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%)
 
 import java.util.ArrayList;

diff --git a/src/main/java/g0001_0100/s0062_unique_paths/Solution.java b/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
@@ -1,9 +1,9 @@
 package g0001_0100.s0062_unique_paths;
 
 // #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_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%)
+// #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_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%)
 
 public class Solution {
     public int uniquePaths(int m, int n) {

diff --git a/src/main/java/g0001_0100/s0072_edit_distance/Solution.java b/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
@@ -1,6 +1,6 @@
 package g0001_0100.s0072_edit_distance;
 
-// #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_Programming #Dynamic_Programming_I_Day_19
 // #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
 // #2024_11_11_Time_3_ms_(97.19%)_Space_43.2_MB_(98.23%)

diff --git a/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java b/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
@@ -1,7 +1,7 @@
 package g0101_0200.s0104_maximum_depth_of_binary_tree;
 
 // #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
 // #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
 // #2024_11_13_Time_0_ms_(100.00%)_Space_42.2_MB_(88.11%)

diff --git a/src/main/java/g0101_0200/s0136_single_number/Solution.java b/src/main/java/g0101_0200/s0136_single_number/Solution.java
@@ -1,9 +1,9 @@
 package g0101_0200.s0136_single_number;
 
 // #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
-// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1)
-// #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%)
+// #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_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%)
 
 public class Solution {
     public int singleNumber(int[] nums) {

diff --git a/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java b/src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java
@@ -1,7 +1,7 @@
 package g0101_0200.s0151_reverse_words_in_a_string;
 
-// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String
-// #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%)
+// #Medium #String #Two_Pointers #LeetCode_75_Array/String #Udemy_Strings
+// #Top_Interview_150_Array/String #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%)
 
 public class Solution {
     public String reverseWords(String s) {

diff --git a/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java b/src/main/java/g0101_0200/s0162_find_peak_element/Solution.java
@@ -1,7 +1,7 @@
 package g0101_0200.s0162_find_peak_element;
 
-// #Medium #Top_Interview_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
-// #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
+// #Medium #Top_Interview_Questions #Array #Binary_Search #LeetCode_75_Binary_Search
+// #Algorithm_II_Day_2_Binary_Search #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
 // #2025_03_06_Time_0_ms_(100.00%)_Space_42.78_MB_(21.39%)
 
 public class Solution {

diff --git a/src/main/java/g0101_0200/s0198_house_robber/Solution.java b/src/main/java/g0101_0200/s0198_house_robber/Solution.java
@@ -1,7 +1,7 @@
 package g0101_0200.s0198_house_robber;
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
-// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
+// #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) #2024_11_15_Time_0_ms_(100.00%)_Space_40.7_MB_(77.55%)
 

diff --git a/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java b/src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java
@@ -1,8 +1,8 @@
 package g0101_0200.s0199_binary_tree_right_side_view;
 
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
-// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree #Top_Interview_150_Binary_Tree_BFS
-// #2025_03_09_Time_0_ms_(100.00%)_Space_42.21_MB_(42.76%)
+// #LeetCode_75_Binary_Tree/BFS #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree
+// #Top_Interview_150_Binary_Tree_BFS #2025_03_09_Time_0_ms_(100.00%)_Space_42.21_MB_(42.76%)
 
 import com_github_leetcode.TreeNode;
 import java.util.ArrayList;

diff --git a/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java b/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
@@ -1,9 +1,9 @@
 package g0201_0300.s0206_reverse_linked_list;
 
 // #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)
-// #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%)
+// #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) #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java b/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java
@@ -1,7 +1,7 @@
 package g0201_0300.s0208_implement_trie_prefix_tree;
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
-// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_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)
 // #2024_11_15_Time_32_ms_(95.05%)_Space_54.9_MB_(91.16%)
 

diff --git a/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java b/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java
@@ -1,9 +1,9 @@
 package g0201_0300.s0215_kth_largest_element_in_an_array;
 
 // #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
-// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n))
-// #2022_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%)
+// #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)) #2022_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java b/src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java
@@ -1,6 +1,6 @@
 package g0201_0300.s0216_combination_sum_iii;
 
-// #Medium #Array #Backtracking #Udemy_Backtracking/Recursion
+// #Medium #Array #Backtracking #LeetCode_75_Backtracking #Udemy_Backtracking/Recursion
 // #2022_07_02_Time_1_ms_(81.35%)_Space_41.8_MB_(46.36%)
 
 import java.util.ArrayList;

diff --git a/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java b/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java
@@ -1,8 +1,9 @@
 package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree;
 
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
-// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
-// #Big_O_Time_O(n)_Space_O(n) #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%)
+// #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)
+// #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%)
 
 import com_github_leetcode.TreeNode;
 

diff --git a/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java b/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java
@@ -1,8 +1,8 @@
 package g0201_0300.s0238_product_of_array_except_self;
 
-// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
-// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n)
-// #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%)
+// #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) #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%)
 
 public class Solution {
     public int[] productExceptSelf(int[] nums) {

diff --git a/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java b/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java
@@ -1,8 +1,8 @@
 package g0201_0300.s0283_move_zeroes;
 
-// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
-// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
-// #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%)
+// #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) #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%)
 
 public class Solution {
     public void moveZeroes(int[] nums) {

diff --git a/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java b/src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java
@@ -1,6 +1,6 @@
 package g0301_0400.s0328_odd_even_linked_list;
 
-// #Medium #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
+// #Medium #Linked_List #LeetCode_75_LinkedList #Level_2_Day_4_Linked_List #Udemy_Linked_List
 // #2022_07_09_Time_0_ms_(100.00%)_Space_44.8_MB_(44.32%)
 
 import com_github_leetcode.ListNode;

diff --git a/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java b/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java
@@ -1,6 +1,6 @@
 package g0301_0400.s0334_increasing_triplet_subsequence;
 
-// #Medium #Array #Greedy #Data_Structure_II_Day_5_Array
+// #Medium #Array #Greedy #LeetCode_75_Array/String #Data_Structure_II_Day_5_Array
 // #2022_07_10_Time_2_ms_(99.33%)_Space_93.5_MB_(47.20%)
 
 public class Solution {

diff --git a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java
@@ -1,7 +1,8 @@
 package g0301_0400.s0338_counting_bits;
 
-// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
-// #Big_O_Time_O(num)_Space_O(num) #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%)
+// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
+// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
+// #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%)
 
 public class Solution {
     public int[] countBits(int num) {

diff --git a/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java b/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java
@@ -1,6 +1,7 @@
 package g0301_0400.s0345_reverse_vowels_of_a_string;
 
-// #Easy #String #Two_Pointers #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%)
+// #Easy #String #Two_Pointers #LeetCode_75_Array/String
+// #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%)
 
 public class Solution {
     private boolean isVowel(char c) {

diff --git a/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java b/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java
@@ -1,6 +1,6 @@
 package g0301_0400.s0374_guess_number_higher_or_lower;
 
-// #Easy #Binary_Search #Interactive #Binary_Search_I_Day_1
+// #Easy #Binary_Search #Interactive #LeetCode_75_Binary_Search #Binary_Search_I_Day_1
 // #2022_07_12_Time_0_ms_(100.00%)_Space_40.4_MB_(74.20%)
 
 /*

diff --git a/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java b/src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
@@ -1,8 +1,8 @@
 package g0301_0400.s0392_is_subsequence;
 
-// #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19
-// #Level_1_Day_2_String #Udemy_Two_Pointers #Top_Interview_150_Two_Pointers
-// #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%)
+// #Easy #String #Dynamic_Programming #Two_Pointers #LeetCode_75_Two_Pointers
+// #Dynamic_Programming_I_Day_19 #Level_1_Day_2_String #Udemy_Two_Pointers
+// #Top_Interview_150_Two_Pointers #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%)
 
 public class Solution {
     public boolean isSubsequence(String s, String t) {

diff --git a/src/main/java/g0301_0400/s0394_decode_string/Solution.java b/src/main/java/g0301_0400/s0394_decode_string/Solution.java
@@ -1,7 +1,8 @@
 package g0301_0400.s0394_decode_string;
 
-// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
-// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%)
+// #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)
+// #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%)
 
 public class Solution {
     private int i = 0;

diff --git a/src/main/java/g0301_0400/s0399_evaluate_division/Solution.java b/src/main/java/g0301_0400/s0399_evaluate_division/Solution.java
@@ -1,7 +1,8 @@
 package g0301_0400.s0399_evaluate_division;
 
 // #Medium #Array #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #Shortest_Path
-// #Top_Interview_150_Graph_General #2022_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%)
+// #LeetCode_75_Graphs/DFS #Top_Interview_150_Graph_General
+// #2022_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%)
 
 import java.util.HashMap;
 import java.util.List;

diff --git a/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java b/src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java
@@ -1,7 +1,7 @@
 package g0401_0500.s0435_non_overlapping_intervals;
 
-// #Medium #Array #Dynamic_Programming #Sorting #Greedy #Data_Structure_II_Day_4_Array
-// #2022_07_16_Time_96_ms_(47.37%)_Space_106.6_MB_(6.15%)
+// #Medium #Array #Dynamic_Programming #Sorting #Greedy #LeetCode_75_Intervals
+// #Data_Structure_II_Day_4_Array #2022_07_16_Time_96_ms_(47.37%)_Space_106.6_MB_(6.15%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java
@@ -1,7 +1,7 @@
 package g0401_0500.s0437_path_sum_iii;
 
-// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
-// #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%)
+// #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) #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%)
 
 import com_github_leetcode.TreeNode;
 import java.util.HashMap;

diff --git a/src/main/java/g0401_0500/s0443_string_compression/Solution.java b/src/main/java/g0401_0500/s0443_string_compression/Solution.java
@@ -1,6 +1,7 @@
 package g0401_0500.s0443_string_compression;
 
-// #Medium #String #Two_Pointers #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%)
+// #Medium #String #Two_Pointers #LeetCode_75_Array/String
+// #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%)
 
 public class Solution {
     /* This is breaking the rules, it's not in-place. */

diff --git a/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java b/src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java
@@ -1,7 +1,7 @@
 package g0401_0500.s0450_delete_node_in_a_bst;
 
-// #Medium #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_II_Day_16_Tree
-// #2022_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%)
+// #Medium #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree
+// #Data_Structure_II_Day_16_Tree #2022_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%)
 
 import com_github_leetcode.TreeNode;
 

diff --git a/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java b/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java
@@ -1,6 +1,6 @@
 package g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons;
 
-// #Medium #Array #Sorting #Greedy #Top_Interview_150_Intervals
+// #Medium #Array #Sorting #Greedy #LeetCode_75_Intervals #Top_Interview_150_Intervals
 // #2025_03_09_Time_52_ms_(89.91%)_Space_68.86_MB_(77.92%)
 
 import java.util.Arrays;

diff --git a/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java b/src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java
@@ -1,6 +1,6 @@
 package g0501_0600.s0547_number_of_provinces;
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find
+// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #LeetCode_75_Graphs/DFS
 // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search
 // #Graph_Theory_I_Day_8_Standard_Traversal #Level_2_Day_19_Union_Find
 // #2022_08_02_Time_2_ms_(69.51%)_Space_54.2_MB_(42.16%)

diff --git a/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java b/src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java
@@ -1,6 +1,7 @@
 package g0601_0700.s0605_can_place_flowers;
 
-// #Easy #Array #Greedy #Udemy_Arrays #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%)
+// #Easy #Array #Greedy #LeetCode_75_Array/String #Udemy_Arrays
+// #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%)
 
 public class Solution {
     public boolean canPlaceFlowers(int[] flowerbed, int n) {

diff --git a/src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java b/src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java
@@ -1,6 +1,7 @@
 package g0601_0700.s0643_maximum_average_subarray_i;
 
-// #Easy #Array #Sliding_Window #2022_03_21_Time_5_ms_(74.81%)_Space_58.3_MB_(84.86%)
+// #Easy #Array #Sliding_Window #LeetCode_75_Sliding_Window
+// #2022_03_21_Time_5_ms_(74.81%)_Space_58.3_MB_(84.86%)
 
 public class Solution {
     public double findMaxAverage(int[] nums, int k) {

diff --git a/src/main/java/g0601_0700/s0649_dota2_senate/Solution.java b/src/main/java/g0601_0700/s0649_dota2_senate/Solution.java
@@ -1,6 +1,7 @@
 package g0601_0700.s0649_dota2_senate;
 
-// #Medium #String #Greedy #Queue #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%)
+// #Medium #String #Greedy #Queue #LeetCode_75_Queue
+// #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%)
 
 public class Solution {
     public String predictPartyVictory(String senate) {

diff --git a/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java b/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java
@@ -1,7 +1,7 @@
 package g0601_0700.s0700_search_in_a_binary_search_tree;
 
-// #Easy #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_13_Tree
-// #2022_03_22_Time_0_ms_(100.00%)_Space_52.3_MB_(6.38%)
+// #Easy #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree
+// #Data_Structure_I_Day_13_Tree #2022_03_22_Time_0_ms_(100.00%)_Space_52.3_MB_(6.38%)
 
 import com_github_leetcode.TreeNode;
 

diff --git a/.../java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java b/.../java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java
@@ -1,7 +1,7 @@
 package g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee;
 
-// #Medium #Array #Dynamic_Programming #Greedy #Dynamic_Programming_I_Day_8
-// #2022_03_24_Time_4_ms_(78.57%)_Space_75.9_MB_(33.27%)
+// #Medium #Array #Dynamic_Programming #Greedy #LeetCode_75_DP/Multidimensional
+// #Dynamic_Programming_I_Day_8 #2022_03_24_Time_4_ms_(78.57%)_Space_75.9_MB_(33.27%)
 
 public class Solution {
     public int maxProfit(int[] prices, int fee) {

diff --git a/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java b/src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java
@@ -1,6 +1,6 @@
 package g0701_0800.s0724_find_pivot_index;
 
-// #Easy #Array #Prefix_Sum #Level_1_Day_1_Prefix_Sum
+// #Easy #Array #Prefix_Sum #LeetCode_75_Prefix_Sum #Level_1_Day_1_Prefix_Sum
 // #2022_03_24_Time_2_ms_(69.67%)_Space_52.1_MB_(59.19%)
 
 public class Solution {

diff --git a/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java b/src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java
@@ -1,6 +1,7 @@
 package g0701_0800.s0735_asteroid_collision;
 
-// #Medium #Array #Stack #Level_2_Day_18_Stack #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%)
+// #Medium #Array #Stack #LeetCode_75_Stack #Level_2_Day_18_Stack
+// #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%)
 
 import java.util.Deque;
 import java.util.LinkedList;

diff --git a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java
@@ -1,7 +1,8 @@
 package g0701_0800.s0739_daily_temperatures;
 
-// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
-// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%)
+// #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)
+// #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%)
 
 @SuppressWarnings("java:S135")
 public class Solution {

diff --git a/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java b/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java
@@ -1,6 +1,6 @@
 package g0701_0800.s0746_min_cost_climbing_stairs;
 
-// #Easy #Array #Dynamic_Programming #Dynamic_Programming_I_Day_2
+// #Easy #Array #Dynamic_Programming #LeetCode_75_DP/1D #Dynamic_Programming_I_Day_2
 // #Level_1_Day_11_Dynamic_Programming #2022_03_25_Time_1_ms_(86.38%)_Space_43.6_MB_(54.14%)
 
 public class Solution {

diff --git a/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling/Solution.java b/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling/Solution.java
@@ -1,6 +1,7 @@
 package g0701_0800.s0790_domino_and_tromino_tiling;
 
-// #Medium #Dynamic_Programming #2022_03_26_Time_0_ms_(100.00%)_Space_42_MB_(14.39%)
+// #Medium #Dynamic_Programming #LeetCode_75_DP/1D
+// #2022_03_26_Time_0_ms_(100.00%)_Space_42_MB_(14.39%)
 
 public class Solution {
     public int numTilings(int n) {

diff --git a/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java b/src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java
@@ -1,7 +1,8 @@
 package g0801_0900.s0841_keys_and_rooms;
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Data_Structure_II_Day_19_Graph
-// #Graph_Theory_I_Day_7_Standard_Traversal #2022_03_24_Time_3_ms_(51.54%)_Space_42.3_MB_(75.53%)
+// #Medium #Depth_First_Search #Breadth_First_Search #Graph #LeetCode_75_Graphs/DFS
+// #Data_Structure_II_Day_19_Graph #Graph_Theory_I_Day_7_Standard_Traversal
+// #2022_03_24_Time_3_ms_(51.54%)_Space_42.3_MB_(75.53%)
 
 import java.util.HashSet;
 import java.util.List;

diff --git a/src/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java b/src/main/java/g0801_0900/s0872_leaf_similar_trees/Solution.java
@@ -1,6 +1,6 @@
 package g0801_0900.s0872_leaf_similar_trees;
 
-// #Easy #Depth_First_Search #Tree #Binary_Tree
+// #Easy #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS
 // #2022_03_28_Time_0_ms_(100.00%)_Space_41.8_MB_(64.12%)
 
 import com_github_leetcode.TreeNode;

diff --git a/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java b/src/main/java/g0801_0900/s0875_koko_eating_bananas/Solution.java
@@ -1,6 +1,6 @@
 package g0801_0900.s0875_koko_eating_bananas;
 
-// #Medium #Array #Binary_Search #Binary_Search_II_Day_4
+// #Medium #Array #Binary_Search #LeetCode_75_Binary_Search #Binary_Search_II_Day_4
 // #2022_03_28_Time_15_ms_(91.32%)_Space_55_MB_(6.01%)
 
 public class Solution {

diff --git a/src/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java b/src/main/java/g0901_1000/s0901_online_stock_span/StockSpanner.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0901_online_stock_span;
 
-// #Medium #Stack #Design #Monotonic_Stack #Data_Stream
+// #Medium #Stack #Design #Monotonic_Stack #Data_Stream #LeetCode_75_Monotonic_Stack
 // #2022_03_28_Time_47_ms_(76.17%)_Space_88.8_MB_(5.16%)
 
 import java.util.Deque;

diff --git a/src/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java b/src/main/java/g0901_1000/s0933_number_of_recent_calls/RecentCounter.java
@@ -1,6 +1,7 @@
 package g0901_1000.s0933_number_of_recent_calls;
 
-// #Easy #Design #Queue #Data_Stream #2022_03_30_Time_16_ms_(97.58%)_Space_50.8_MB_(80.12%)
+// #Easy #Design #Queue #Data_Stream #LeetCode_75_Queue
+// #2022_03_30_Time_16_ms_(97.58%)_Space_50.8_MB_(80.12%)
 
 import java.util.LinkedList;
 import java.util.Queue;

diff --git a/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java b/src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java
@@ -1,6 +1,6 @@
 package g0901_1000.s0994_rotting_oranges;
 
-// #Medium #Top_100_Liked_Questions #Array #Breadth_First_Search #Matrix
+// #Medium #Top_100_Liked_Questions #Array #Breadth_First_Search #Matrix #LeetCode_75_Graphs/BFS
 // #Algorithm_I_Day_9_Breadth_First_Search_Depth_First_Search #Level_2_Day_10_Graph/BFS/DFS
 // #2022_02_17_Time_3_ms_(74.27%)_Space_42.9_MB_(18.68%)
 

diff --git a/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java b/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java
@@ -1,6 +1,6 @@
 package g1001_1100.s1004_max_consecutive_ones_iii;
 
-// #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window
+// #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window #LeetCode_75_Sliding_Window
 // #2022_02_27_Time_3_ms_(79.01%)_Space_68.2_MB_(65.91%)
 
 public class Solution {

diff --git a/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.java b/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings/Solution.java
@@ -1,6 +1,7 @@
 package g1001_1100.s1071_greatest_common_divisor_of_strings;
 
-// #Easy #String #Math #2022_02_27_Time_1_ms_(82.09%)_Space_42.6_MB_(33.55%)
+// #Easy #String #Math #LeetCode_75_Array/String
+// #2022_02_27_Time_1_ms_(82.09%)_Space_42.6_MB_(33.55%)
 
 public class Solution {
     public String gcdOfStrings(String str1, String str2) {

diff --git a/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java b/src/main/java/g1101_1200/s1137_n_th_tribonacci_number/Solution.java
@@ -1,6 +1,6 @@
 package g1101_1200.s1137_n_th_tribonacci_number;
 
-// #Easy #Dynamic_Programming #Math #Memoization #Dynamic_Programming_I_Day_1
+// #Easy #Dynamic_Programming #Math #Memoization #LeetCode_75_DP/1D #Dynamic_Programming_I_Day_1
 // #2023_06_01_Time_0_ms_(100.00%)_Space_39.6_MB_(48.37%)
 
 public class Solution {

diff --git a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java
@@ -1,6 +1,6 @@
 package g1101_1200.s1143_longest_common_subsequence;
 
-// #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)
 // #2024_11_17_Time_19_ms_(89.05%)_Space_50.9_MB_(33.70%)

diff --git a/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java b/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree/Solution.java
@@ -1,6 +1,6 @@
 package g1101_1200.s1161_maximum_level_sum_of_a_binary_tree;
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
+// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/BFS
 // #2023_06_02_Time_7_ms_(97.19%)_Space_46.3_MB_(31.31%)
 
 import com_github_leetcode.TreeNode;

diff --git a/src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java b/src/main/java/g1201_1300/s1207_unique_number_of_occurrences/Solution.java
@@ -1,6 +1,7 @@
 package g1201_1300.s1207_unique_number_of_occurrences;
 
-// #Easy #Array #Hash_Table #2022_04_29_Time_2_ms_(82.71%)_Space_42.4_MB_(34.08%)
+// #Easy #Array #Hash_Table #LeetCode_75_Hash_Map/Set
+// #2022_04_29_Time_2_ms_(82.71%)_Space_42.4_MB_(34.08%)
 
 import java.util.HashMap;
 import java.util.Map;

diff --git a/src/main/java/g1201_1300/s1268_search_suggestions_system/Solution.java b/src/main/java/g1201_1300/s1268_search_suggestions_system/Solution.java
@@ -1,6 +1,6 @@
 package g1201_1300.s1268_search_suggestions_system;
 
-// #Medium #Array #String #2022_03_14_Time_28_ms_(78.06%)_Space_73.1_MB_(38.32%)
+// #Medium #Array #String #LeetCode_75_Trie #2022_03_14_Time_28_ms_(78.06%)_Space_73.1_MB_(38.32%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.java b/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c/Solution.java
@@ -1,6 +1,7 @@
 package g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c;
 
-// #Medium #Bit_Manipulation #2022_03_19_Time_0_ms_(100.00%)_Space_40.6_MB_(60.32%)
+// #Medium #Bit_Manipulation #LeetCode_75_Bit_Manipulation
+// #2022_03_19_Time_0_ms_(100.00%)_Space_40.6_MB_(60.32%)
 
 public class Solution {
     public static int csb(int n) {

diff --git a/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.java b/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree/Solution.java
@@ -1,6 +1,6 @@
 package g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree;
 
-// #Medium #Dynamic_Programming #Depth_First_Search #Tree #Binary_Tree
+// #Medium #Dynamic_Programming #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS
 // #2022_03_21_Time_9_ms_(64.47%)_Space_74_MB_(56.45%)
 
 import com_github_leetcode.TreeNode;

diff --git a/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.java b/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies/Solution.java
@@ -1,6 +1,6 @@
 package g1401_1500.s1431_kids_with_the_greatest_number_of_candies;
 
-// #Easy #Array #2022_03_28_Time_1_ms_(84.43%)_Space_43.3_MB_(19.35%)
+// #Easy #Array #LeetCode_75_Array/String #2022_03_28_Time_1_ms_(84.43%)_Space_43.3_MB_(19.35%)
 
 import java.util.ArrayList;
 import java.util.List;

diff --git a/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.java b/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree/Solution.java
@@ -1,6 +1,6 @@
 package g1401_1500.s1448_count_good_nodes_in_binary_tree;
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
+// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS
 // #2022_03_28_Time_2_ms_(99.63%)_Space_60.1_MB_(26.46%)
 
 import com_github_leetcode.TreeNode;

diff --git a/...va/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.java b/...va/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length/Solution.java
@@ -1,6 +1,7 @@
 package g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length;
 
-// #Medium #String #Sliding_Window #2022_03_28_Time_19_ms_(53.73%)_Space_47.8_MB_(64.37%)
+// #Medium #String #Sliding_Window #LeetCode_75_Sliding_Window
+// #2022_03_28_Time_19_ms_(53.73%)_Space_47.8_MB_(64.37%)
 
 public class Solution {
     private boolean isVowel(char c) {

diff --git a/...ava/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java b/...ava/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java
@@ -1,6 +1,6 @@
 package g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero;
 
-// #Medium #Depth_First_Search #Breadth_First_Search #Graph
+// #Medium #Depth_First_Search #Breadth_First_Search #Graph #LeetCode_75_Graphs/DFS
 // #Graph_Theory_I_Day_10_Standard_Traversal #2022_03_29_Time_39_ms_(97.71%)_Space_65.2_MB_(94.87%)
 
 import java.util.ArrayList;

diff --git a/...ain/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.java b/...ain/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element/Solution.java
@@ -1,6 +1,6 @@
 package g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element;
 
-// #Medium #Dynamic_Programming #Math #Sliding_Window
+// #Medium #Dynamic_Programming #Math #Sliding_Window #LeetCode_75_Sliding_Window
 // #2022_03_23_Time_2_ms_(87.25%)_Space_58.4_MB_(29.26%)
 
 public class Solution {

diff --git a/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.java b/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close/Solution.java
@@ -1,6 +1,7 @@
 package g1601_1700.s1657_determine_if_two_strings_are_close;
 
-// #Medium #String #Hash_Table #Sorting #2022_04_23_Time_12_ms_(97.58%)_Space_59.6_MB_(39.11%)
+// #Medium #String #Hash_Table #Sorting #LeetCode_75_Hash_Map/Set
+// #2022_04_23_Time_12_ms_(97.58%)_Space_59.6_MB_(39.11%)
 
 import java.util.Arrays;
 

diff --git a/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java b/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java
@@ -1,6 +1,6 @@
 package g1601_1700.s1679_max_number_of_k_sum_pairs;
 
-// #Medium #Array #Hash_Table #Sorting #Two_Pointers
+// #Medium #Array #Hash_Table #Sorting #Two_Pointers #LeetCode_75_Two_Pointers
 // #2022_04_21_Time_20_ms_(91.22%)_Space_52.7_MB_(87.98%)
 
 import java.util.Arrays;

diff --git a/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java b/src/main/java/g1701_1800/s1732_find_the_highest_altitude/Solution.java
@@ -1,6 +1,7 @@
 package g1701_1800.s1732_find_the_highest_altitude;
 
-// #Easy #Array #Prefix_Sum #2022_04_28_Time_0_ms_(100.00%)_Space_40.1_MB_(83.65%)
+// #Easy #Array #Prefix_Sum #LeetCode_75_Prefix_Sum
+// #2022_04_28_Time_0_ms_(100.00%)_Space_40.1_MB_(83.65%)
 
 public class Solution {
     public int largestAltitude(int[] gain) {

diff --git a/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java b/src/main/java/g1701_1800/s1768_merge_strings_alternately/Solution.java
@@ -1,6 +1,6 @@
 package g1701_1800.s1768_merge_strings_alternately;
 
-// #Easy #String #Two_Pointers #Programming_Skills_I_Day_8_String
+// #Easy #String #Two_Pointers #LeetCode_75_Array/String #Programming_Skills_I_Day_8_String
 // #2022_04_27_Time_1_ms_(86.26%)_Space_41.7_MB_(79.68%)
 
 public class Solution {

diff --git a/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java b/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java
@@ -1,6 +1,7 @@
 package g1901_2000.s1926_nearest_exit_from_entrance_in_maze;
 
-// #Medium #Array #Breadth_First_Search #Matrix #Graph_Theory_I_Day_6_Matrix_Related_Problems
+// #Medium #Array #Breadth_First_Search #Matrix #LeetCode_75_Graphs/BFS
+// #Graph_Theory_I_Day_6_Matrix_Related_Problems
 // #2022_05_14_Time_12_ms_(40.55%)_Space_43.3_MB_(92.19%)
 
 import java.util.LinkedList;

diff --git a/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java b/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list/Solution.java
@@ -1,6 +1,7 @@
 package g2001_2100.s2095_delete_the_middle_node_of_a_linked_list;
 
-// #Medium #Two_Pointers #Linked_List #2022_05_24_Time_4_ms_(95.21%)_Space_221.2_MB_(35.96%)
+// #Medium #Two_Pointers #Linked_List #LeetCode_75_LinkedList
+// #2022_05_24_Time_4_ms_(95.21%)_Space_221.2_MB_(35.96%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.java b/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list/Solution.java
@@ -1,6 +1,7 @@
 package g2101_2200.s2130_maximum_twin_sum_of_a_linked_list;
 
-// #Medium #Two_Pointers #Stack #Linked_List #2022_06_03_Time_9_ms_(57.92%)_Space_118.7_MB_(38.33%)
+// #Medium #Two_Pointers #Stack #Linked_List #LeetCode_75_LinkedList
+// #2022_06_03_Time_9_ms_(57.92%)_Space_118.7_MB_(38.33%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.java b/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays/Solution.java
@@ -1,6 +1,7 @@
 package g2201_2300.s2215_find_the_difference_of_two_arrays;
 
-// #Easy #Array #Hash_Table #2022_06_09_Time_11_ms_(87.39%)_Space_43.2_MB_(77.06%)
+// #Easy #Array #Hash_Table #LeetCode_75_Hash_Map/Set
+// #2022_06_09_Time_11_ms_(87.39%)_Space_43.2_MB_(77.06%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.java b/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions/Solution.java
@@ -1,6 +1,6 @@
 package g2201_2300.s2300_successful_pairs_of_spells_and_potions;
 
-// #Medium #Array #Sorting #Binary_Search #Two_Pointers
+// #Medium #Array #Sorting #Binary_Search #Two_Pointers #LeetCode_75_Binary_Search
 // #2022_06_14_Time_85_ms_(71.70%)_Space_135.9_MB_(33.90%)
 
 import java.util.Arrays;

diff --git a/src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.java b/src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set/SmallestInfiniteSet.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2336_smallest_number_in_infinite_set;
 
-// #Medium #Hash_Table #Design #Heap_Priority_Queue
+// #Medium #Hash_Table #Design #Heap_Priority_Queue #LeetCode_75_Heap/Priority_Queue
 // #2022_07_13_Time_12_ms_(96.69%)_Space_54.8_MB_(57.87%)
 
 public class SmallestInfiniteSet {

diff --git a/src/main/java/g2301_2400/s2352_equal_row_and_column_pairs/Solution.java b/src/main/java/g2301_2400/s2352_equal_row_and_column_pairs/Solution.java
@@ -1,6 +1,6 @@
 package g2301_2400.s2352_equal_row_and_column_pairs;
 
-// #Medium #Array #Hash_Table #Matrix #Simulation
+// #Medium #Array #Hash_Table #Matrix #Simulation #LeetCode_75_Hash_Map/Set
 // #2022_08_07_Time_7_ms_(98.94%)_Space_71.4_MB_(27.97%)
 
 import java.util.Arrays;

diff --git a/src/main/java/g2301_2400/s2390_removing_stars_from_a_string/Solution.java b/src/main/java/g2301_2400/s2390_removing_stars_from_a_string/Solution.java
@@ -1,6 +1,7 @@
 package g2301_2400.s2390_removing_stars_from_a_string;
 
-// #Medium #String #Stack #Simulation #2022_09_02_Time_31_ms_(90.55%)_Space_62.6_MB_(76.40%)
+// #Medium #String #Stack #Simulation #LeetCode_75_Stack
+// #2022_09_02_Time_31_ms_(90.55%)_Space_62.6_MB_(76.40%)
 
 public class Solution {
     public String removeStars(String s) {

diff --git a/src/main/java/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.java b/src/main/java/g2401_2500/s2462_total_cost_to_hire_k_workers/Solution.java
@@ -1,6 +1,6 @@
 package g2401_2500.s2462_total_cost_to_hire_k_workers;
 
-// #Medium #Array #Two_Pointers #Heap_Priority_Queue #Simulation
+// #Medium #Array #Two_Pointers #Heap_Priority_Queue #Simulation #LeetCode_75_Heap/Priority_Queue
 // #2023_01_07_Time_57_ms_(96.24%)_Space_54_MB_(92.26%)
 
 import java.util.PriorityQueue;

diff --git a/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java b/src/main/java/g2501_2600/s2542_maximum_subsequence_score/Solution.java
@@ -1,6 +1,6 @@
 package g2501_2600.s2542_maximum_subsequence_score;
 
-// #Medium #Array #Sorting #Greedy #Heap_Priority_Queue
+// #Medium #Array #Sorting #Greedy #Heap_Priority_Queue #LeetCode_75_Heap/Priority_Queue
 // #2023_05_09_Time_94_ms_(84.75%)_Space_56.5_MB_(81.92%)
 
 import java.util.Arrays;