Updated tag #Top_100_Liked_Questions

javadev · web-flow · commit a00b92fc8986 · 2025-07-03T06:23:04.000+03:00
diff --git a/README.md b/README.md
diff --git a/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt b/src/main/kotlin/g0001_0100/s0013_roman_to_integer/Solution.kt
@@ -1,7 +1,7 @@
 package g0001_0100.s0013_roman_to_integer
 
-// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
-// #Top_Interview_150_Array/String #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%)
+// #Easy #Top_Interview_Questions #String #Hash_Table #Math #Top_Interview_150_Array/String
+// #2023_07_03_Time_211_ms_(83.47%)_Space_36.9_MB_(91.66%)
 
 class Solution {
     fun romanToInt(s: String): Int {
diff --git a/src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt b/src/main/kotlin/g0001_0100/s0014_longest_common_prefix/Solution.kt
@@ -1,8 +1,7 @@
 package g0001_0100.s0014_longest_common_prefix
 
-// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String
-// #Udemy_Strings #Top_Interview_150_Array/String
-// #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%)
+// #Easy #Top_Interview_Questions #String #Level_2_Day_2_String #Udemy_Strings
+// #Top_Interview_150_Array/String #2023_07_03_Time_154_ms_(89.70%)_Space_34.6_MB_(95.06%)
 
 class Solution {
     fun longestCommonPrefix(strs: Array<String>): String {
diff --git a/src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree/Solution.kt
@@ -1,8 +1,9 @@
 package g0101_0200.s0108_convert_sorted_array_to_binary_search_tree
 
-// #Easy #Top_Interview_Questions #Array #Tree #Binary_Tree #Binary_Search_Tree #Divide_and_Conquer
-// #Data_Structure_II_Day_15_Tree #Level_2_Day_9_Binary_Search_Tree #Udemy_Tree_Stack_Queue
-// #Top_Interview_150_Divide_and_Conquer #2023_07_11_Time_167_ms_(80.29%)_Space_36.6_MB_(83.94%)
+// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Tree #Binary_Tree
+// #Binary_Search_Tree #Divide_and_Conquer #Data_Structure_II_Day_15_Tree
+// #Level_2_Day_9_Binary_Search_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Divide_and_Conquer
+// #2023_07_11_Time_167_ms_(80.29%)_Space_36.6_MB_(83.94%)
 
 import com_github_leetcode.TreeNode
 
diff --git a/src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt b/src/main/kotlin/g0201_0300/s0279_perfect_squares/Solution.kt
@@ -1,7 +1,7 @@
 package g0201_0300.s0279_perfect_squares
 
-// #Medium #Dynamic_Programming #Math #Breadth_First_Search #Dynamic_Programming_I_Day_21
-// #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)
+// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Breadth_First_Search
+// #Dynamic_Programming_I_Day_21 #2022_11_03_Time_176_ms_(98.80%)_Space_33.3_MB_(98.80%)
 
 @Suppress("NAME_SHADOWING")
 class Solution {
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,8 @@
 package g0401_0500.s0437_path_sum_iii
 
-// #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%)
+// #Medium #Top_100_Liked_Questions #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/g0501_0600/s0567_permutation_in_string/Solution.kt b/src/main/kotlin/g0501_0600/s0567_permutation_in_string/Solution.kt
@@ -1,7 +1,7 @@
 package g0501_0600.s0567_permutation_in_string
 
-// #Medium #Top_100_Liked_Questions #String #Hash_Table #Two_Pointers #Sliding_Window
-// #Algorithm_I_Day_6_Sliding_Window #2023_01_23_Time_169_ms_(100.00%)_Space_35.6_MB_(85.86%)
+// #Medium #String #Hash_Table #Two_Pointers #Sliding_Window #Algorithm_I_Day_6_Sliding_Window
+// #2023_01_23_Time_169_ms_(100.00%)_Space_35.6_MB_(85.86%)
 
 class Solution {
     fun checkInclusion(s1: String, s2: String): Boolean {
diff --git a/src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt b/src/main/kotlin/g0701_0800/s0704_binary_search/Solution.kt
@@ -1,7 +1,7 @@
 package g0701_0800.s0704_binary_search
 
-// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
-// #Binary_Search_I_Day_1 #Level_1_Day_7_Binary_Search #Udemy_Binary_Search
+// #Easy #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search #Binary_Search_I_Day_1
+// #Level_1_Day_7_Binary_Search #Udemy_Binary_Search
 // #2023_02_23_Time_261_ms_(77.91%)_Space_38.7_MB_(34.19%)
 
 class Solution {
diff --git a/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt b/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt
@@ -1,7 +1,8 @@
 package g0701_0800.s0763_partition_labels
 
-// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
-// #Big_O_Time_O(n)_Space_O(1) #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%)
+// #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers
+// #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1)
+// #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%)
 
 class Solution {
     fun partitionLabels(s: String): List<Int> {
diff --git a/src/main/kotlin/g3501_3600/s3585_find_weighted_median_node_in_tree/Solution.kt b/src/main/kotlin/g3501_3600/s3585_find_weighted_median_node_in_tree/Solution.kt
@@ -1,6 +1,6 @@
 package g3501_3600.s3585_find_weighted_median_node_in_tree
 
-// #Hard #Array #Dynamic_Programming #Tree #Binary_Search #Depth_First_Search
+// #Hard #Array #Dynamic_Programming #Depth_First_Search #Tree #Binary_Search
 // #2025_06_17_Time_123_ms_(100.00%)_Space_184.68_MB_(100.00%)
 
 import kotlin.math.ceil
