Improved tags

Author: javadev

README.md

@@ -1937,7 +1937,7 @@ implementation 'com.github.javadev:leetcode-in-kotlin:1.33'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 0052 |[N-Queens II](src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt)| Hard | Backtracking | 128 | 97.56
+| 0053 |[Maximum Subarray](src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 510 | 78.81
 | 0918 |[Maximum Sum Circular Subarray](src/main/kotlin/g0901_1000/s0918_maximum_sum_circular_subarray/Solution.kt)| Medium | Array, Dynamic_Programming, Divide_and_Conquer, Queue, Monotonic_Queue | 339 | 86.96
 
 #### Top Interview 150 Binary Search

src/main/kotlin/g0001_0100/s0052_n_queens_ii/Solution.kt

@@ -1,6 +1,6 @@
 package g0001_0100.s0052_n_queens_ii
 
-// #Hard #Backtracking #Top_Interview_150_Backtracking #Top_Interview_150_Kadane's_Algorithm
+// #Hard #Backtracking #Top_Interview_150_Backtracking
 // #2023_07_10_Time_128_ms_(97.56%)_Space_32.7_MB_(92.68%)
 
 class Solution {

src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt

@@ -2,7 +2,7 @@ package g0001_0100.s0053_maximum_subarray
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 // #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
-// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
+// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
 // #2023_07_10_Time_510_ms_(78.81%)_Space_54.7_MB_(69.00%)
 
 class Solution {

src/main/kotlin/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array/Solution.kt

@@ -1,6 +1,6 @@
 package g3401_3500.s3423_maximum_difference_between_adjacent_elements_in_a_circular_array
 
-// #Easy #2025_01_19_Time_2_(100.00%)_Space_38.80_(100.00%)
+// #Easy #Array #2025_01_19_Time_2_(100.00%)_Space_38.80_(100.00%)
 
 import kotlin.math.abs
 import kotlin.math.max

src/main/kotlin/g3401_3500/s3425_longest_special_path/Solution.kt

@@ -1,6 +1,7 @@
 package g3401_3500.s3425_longest_special_path
 
-// #Hard #2025_01_19_Time_106_(100.00%)_Space_187.68_(100.00%)
+// #Hard #Array #Hash_Table #Depth_First_Search #Tree #Sliding_Window
+// #2025_01_19_Time_106_(100.00%)_Space_187.68_(100.00%)
 
 class Solution {
     private lateinit var adj: Array<ArrayList<IntArray>>

src/main/kotlin/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces/Solution.kt

@@ -1,6 +1,6 @@
 package g3401_3500.s3426_manhattan_distances_of_all_arrangements_of_pieces
 
-// #Hard #2025_01_19_Time_21_(100.00%)_Space_34.61_(100.00%)
+// #Hard #Math #Combinatorics #2025_01_19_Time_21_(100.00%)_Space_34.61_(100.00%)
 
 class Solution {
     private fun comb(a: Long, b: Long, mod: Long): Long {