javadev · javadev · Apr 13, 2025 · Apr 13, 2025
diff --git a/README.md b/README.md
diff --git a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt
@@ -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)
-// #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%)
+// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
+// #Big_O_Time_O(n)_Space_O(1) #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%)
 
 class Solution {
     fun maxArea(height: IntArray): Int {

diff --git a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt
@@ -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)
 // #2023_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%)
 
 class Solution {

diff --git a/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt b/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt
@@ -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)
-// #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%)
+// #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
+// #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
+// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%)
 
 class Solution {
     fun uniquePaths(m: Int, n: Int): Int {

diff --git a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt
@@ -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)
 // #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%)

diff --git a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt
@@ -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)
 // #2023_07_11_Time_166_ms_(83.53%)_Space_36.5_MB_(86.11%)

diff --git a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt
@@ -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)
-// #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%)
+// #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) #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%)
 
 class Solution {
     fun singleNumber(nums: IntArray): Int {

diff --git a/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt b/src/main/kotlin/g0101_0200/s0151_reverse_words_in_a_string/Solution.kt
@@ -1,7 +1,7 @@
 package g0101_0200.s0151_reverse_words_in_a_string
 
-// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String
-// #2022_10_11_Time_206_ms_(98.90%)_Space_36.1_MB_(96.70%)
+// #Medium #String #Two_Pointers #LeetCode_75_Array/String #Udemy_Strings
+// #Top_Interview_150_Array/String #2022_10_11_Time_206_ms_(98.90%)_Space_36.1_MB_(96.70%)
 
 class Solution {
     fun reverseWords(s: String): String {

diff --git a/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt b/src/main/kotlin/g0101_0200/s0162_find_peak_element/Solution.kt
@@ -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
 // #2022_10_11_Time_297_ms_(53.85%)_Space_36.8_MB_(66.27%)
 
 class Solution {

diff --git a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt
@@ -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) #2022_09_08_Time_156_ms_(92.24%)_Space_34.1_MB_(61.64%)
 

diff --git a/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt b/src/main/kotlin/g0101_0200/s0199_binary_tree_right_side_view/Solution.kt
@@ -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
-// #2022_09_09_Time_194_ms_(92.89%)_Space_35.4_MB_(67.89%)
+// #LeetCode_75_Binary_Tree/BFS #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree
+// #Top_Interview_150_Binary_Tree_BFS #2022_09_09_Time_194_ms_(92.89%)_Space_35.4_MB_(67.89%)
 
 import com_github_leetcode.TreeNode
 

diff --git a/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt b/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt
@@ -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)
-// #2022_09_27_Time_279_ms_(45.78%)_Space_36.2_MB_(49.40%)
+// #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) #2022_09_27_Time_279_ms_(45.78%)_Space_36.2_MB_(49.40%)
 
 import com_github_leetcode.ListNode
 

diff --git a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt
@@ -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)
 // #2022_09_10_Time_689_ms_(61.00%)_Space_87.9_MB_(36.00%)
 

diff --git a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt
@@ -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_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%)
+// #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_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%)
 
 class Solution {
     fun findKthLargest(nums: IntArray, k: Int): Int {

diff --git a/src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt b/src/main/kotlin/g0201_0300/s0216_combination_sum_iii/Solution.kt
@@ -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_10_25_Time_175_ms_(90.91%)_Space_34.4_MB_(72.73%)
 
 class Solution {

diff --git a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt
@@ -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) #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%)
+// #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)
+// #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%)
 
 import com_github_leetcode.TreeNode
 

diff --git a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt
@@ -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)
-// #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%)
+// #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) #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%)
 
 class Solution {
     fun productExceptSelf(nums: IntArray): IntArray {

diff --git a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt
@@ -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)
-// #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%)
+// #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) #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%)
 
 class Solution {
     fun moveZeroes(nums: IntArray) {

diff --git a/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt b/src/main/kotlin/g0301_0400/s0328_odd_even_linked_list/Solution.kt
@@ -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_11_12_Time_216_ms_(86.96%)_Space_36.7_MB_(85.22%)
 
 import com_github_leetcode.ListNode

diff --git a/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt b/src/main/kotlin/g0301_0400/s0334_increasing_triplet_subsequence/Solution.kt
@@ -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_11_15_Time_672_ms_(60.61%)_Space_128.6_MB_(5.23%)
 
 class Solution {

diff --git a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt
@@ -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) #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%)
+// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
+// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
+// #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%)
 
 class Solution {
     fun countBits(num: Int): IntArray {

diff --git a/src/main/kotlin/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.kt b/src/main/kotlin/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.kt
@@ -1,6 +1,7 @@
 package g0301_0400.s0345_reverse_vowels_of_a_string
 
-// #Easy #String #Two_Pointers #2022_11_18_Time_349_ms_(80.63%)_Space_42.2_MB_(76.91%)
+// #Easy #String #Two_Pointers #LeetCode_75_Array/String
+// #2022_11_18_Time_349_ms_(80.63%)_Space_42.2_MB_(76.91%)
 
 class Solution {
     private fun isVowel(c: Char): Boolean {

diff --git a/src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt b/src/main/kotlin/g0301_0400/s0374_guess_number_higher_or_lower/Solution.kt
@@ -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_11_22_Time_134_ms_(94.19%)_Space_32.6_MB_(98.60%)
 
 /*

diff --git a/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt b/src/main/kotlin/g0301_0400/s0392_is_subsequence/Solution.kt
@@ -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
-// #2022_11_25_Time_156_ms_(87.74%)_Space_33.9_MB_(90.11%)
+// #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 #2022_11_25_Time_156_ms_(87.74%)_Space_33.9_MB_(90.11%)
 
 class Solution {
     fun isSubsequence(s: String, t: String): Boolean {

diff --git a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt
@@ -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) #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%)
+// #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)
+// #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%)
 
 class Solution {
     private var i = 0

diff --git a/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt b/src/main/kotlin/g0301_0400/s0399_evaluate_division/Solution.kt
@@ -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_11_29_Time_183_ms_(91.49%)_Space_34.6_MB_(95.74%)
+// #LeetCode_75_Graphs/DFS #Top_Interview_150_Graph_General
+// #2022_11_29_Time_183_ms_(91.49%)_Space_34.6_MB_(95.74%)
 
 @Suppress("kotlin:S6518")
 class Solution {

diff --git a/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt b/src/main/kotlin/g0401_0500/s0435_non_overlapping_intervals/Solution.kt
@@ -1,7 +1,7 @@
 package g0401_0500.s0435_non_overlapping_intervals
 
-// #Medium #Array #Dynamic_Programming #Sorting #Greedy #Data_Structure_II_Day_4_Array
-// #2022_12_22_Time_1040_ms_(85.07%)_Space_117.9_MB_(82.09%)
+// #Medium #Array #Dynamic_Programming #Sorting #Greedy #LeetCode_75_Intervals
+// #Data_Structure_II_Day_4_Array #2022_12_22_Time_1040_ms_(85.07%)_Space_117.9_MB_(82.09%)
 
 class Solution {
     fun eraseOverlapIntervals(intervals: Array<IntArray>): Int {

diff --git a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt
@@ -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)
-// #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%)
+// #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) #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%)
 
 import com_github_leetcode.TreeNode
 

diff --git a/src/main/kotlin/g0401_0500/s0443_string_compression/Solution.kt b/src/main/kotlin/g0401_0500/s0443_string_compression/Solution.kt
@@ -1,6 +1,7 @@
 package g0401_0500.s0443_string_compression
 
-// #Medium #String #Two_Pointers #2022_12_23_Time_198_ms_(92.68%)_Space_35.4_MB_(95.12%)
+// #Medium #String #Two_Pointers #LeetCode_75_Array/String
+// #2022_12_23_Time_198_ms_(92.68%)_Space_35.4_MB_(95.12%)
 
 class Solution {
     /* This is breaking the rules, it's not in-place. */

diff --git a/src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt b/src/main/kotlin/g0401_0500/s0450_delete_node_in_a_bst/Solution.kt
@@ -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_12_25_Time_257_ms_(84.62%)_Space_38.6_MB_(92.31%)
+// #Medium #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree
+// #Data_Structure_II_Day_16_Tree #2022_12_25_Time_257_ms_(84.62%)_Space_38.6_MB_(92.31%)
 
 import com_github_leetcode.TreeNode
 

diff --git a/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt b/src/main/kotlin/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.kt
@@ -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
 // #2022_12_25_Time_934_ms_(100.00%)_Space_87_MB_(100.00%)
 
 class Solution {

diff --git a/src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt b/src/main/kotlin/g0501_0600/s0547_number_of_provinces/Solution.kt
@@ -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
 // #2023_01_17_Time_229_ms_(79.73%)_Space_43_MB_(66.22%)

diff --git a/src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt b/src/main/kotlin/g0601_0700/s0605_can_place_flowers/Solution.kt
@@ -1,6 +1,7 @@
 package g0601_0700.s0605_can_place_flowers
 
-// #Easy #Array #Greedy #Udemy_Arrays #2023_02_03_Time_209_ms_(85.71%)_Space_37.3_MB_(71.43%)
+// #Easy #Array #Greedy #LeetCode_75_Array/String #Udemy_Arrays
+// #2023_02_03_Time_209_ms_(85.71%)_Space_37.3_MB_(71.43%)
 
 @Suppress("NAME_SHADOWING")
 class Solution {

diff --git a/src/main/kotlin/g0601_0700/s0643_maximum_average_subarray_i/Solution.kt b/src/main/kotlin/g0601_0700/s0643_maximum_average_subarray_i/Solution.kt
@@ -1,6 +1,7 @@
 package g0601_0700.s0643_maximum_average_subarray_i
 
-// #Easy #Array #Sliding_Window #2023_02_11_Time_494_ms_(98.65%)_Space_45.8_MB_(95.95%)
+// #Easy #Array #Sliding_Window #LeetCode_75_Sliding_Window
+// #2023_02_11_Time_494_ms_(98.65%)_Space_45.8_MB_(95.95%)
 
 class Solution {
     fun findMaxAverage(nums: IntArray, k: Int): Double {

diff --git a/src/main/kotlin/g0601_0700/s0649_dota2_senate/Solution.kt b/src/main/kotlin/g0601_0700/s0649_dota2_senate/Solution.kt
@@ -1,6 +1,7 @@
 package g0601_0700.s0649_dota2_senate
 
-// #Medium #String #Greedy #Queue #2023_02_12_Time_217_ms_(100.00%)_Space_36.1_MB_(100.00%)
+// #Medium #String #Greedy #Queue #LeetCode_75_Queue
+// #2023_02_12_Time_217_ms_(100.00%)_Space_36.1_MB_(100.00%)
 
 class Solution {
     fun predictPartyVictory(senate: String): String {

diff --git a/src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt b/src/main/kotlin/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.kt
@@ -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
-// #2023_02_22_Time_251_ms_(88.31%)_Space_51_MB_(7.79%)
+// #Easy #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree
+// #Data_Structure_I_Day_13_Tree #2023_02_22_Time_251_ms_(88.31%)_Space_51_MB_(7.79%)
 
 import com_github_leetcode.TreeNode
 

diff --git a/.../kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt b/.../kotlin/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.kt
@@ -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
-// #2023_02_25_Time_417_ms_(90.91%)_Space_46.1_MB_(75.00%)
+// #Medium #Array #Dynamic_Programming #Greedy #LeetCode_75_DP/Multidimensional
+// #Dynamic_Programming_I_Day_8 #2023_02_25_Time_417_ms_(90.91%)_Space_46.1_MB_(75.00%)
 
 class Solution {
     fun maxProfit(prices: IntArray, fee: Int): Int {

diff --git a/src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt b/src/main/kotlin/g0701_0800/s0724_find_pivot_index/Solution.kt
@@ -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
 // #2023_02_28_Time_255_ms_(88.92%)_Space_38.7_MB_(93.26%)
 
 class Solution {

diff --git a/src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt b/src/main/kotlin/g0701_0800/s0735_asteroid_collision/Solution.kt
@@ -1,6 +1,6 @@
 package g0701_0800.s0735_asteroid_collision
 
-// #Medium #Array #Stack #Level_2_Day_18_Stack
+// #Medium #Array #Stack #LeetCode_75_Stack #Level_2_Day_18_Stack
 // #2023_03_02_Time_243_ms_(100.00%)_Space_37.9_MB_(88.46%)
 
 import java.util.Deque

diff --git a/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt b/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt
@@ -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) #2022_09_13_Time_936_ms_(80.54%)_Space_79.5_MB_(63.09%)
+// #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)
+// #2022_09_13_Time_936_ms_(80.54%)_Space_79.5_MB_(63.09%)
 
 class Solution {
     fun dailyTemperatures(temperatures: IntArray): IntArray {

diff --git a/src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt b/src/main/kotlin/g0701_0800/s0746_min_cost_climbing_stairs/Solution.kt
@@ -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 #2023_03_04_Time_171_ms_(96.76%)_Space_36_MB_(78.14%)
 
 class Solution {