Improved tasks 3, 4, 3331

Author: javadev

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

@@ -2,7 +2,8 @@ package g0001_0100.s0003_longest_substring_without_repeating_characters
 
 // #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) #2023_07_03_Time_201_ms_(87.28%)_Space_38.3_MB_(60.85%)
+// #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
+// #2023_07_03_Time_201_ms_(87.28%)_Space_38.3_MB_(60.85%)
 
 class Solution {
     fun lengthOfLongestSubstring(s: String): Int {

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

@@ -1,7 +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) #2023_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%)
+// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #AI_can_be_used_to_solve_the_task
+// #2023_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%)
 
 class Solution {
     fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double {

src/main/kotlin/g3301_3400/s3331_find_subtree_sizes_after_changes/Solution.kt

@@ -1,6 +1,6 @@
 package g3301_3400.s3331_find_subtree_sizes_after_changes
 
-// #Medium #Array #String #Hash_Table #Tree #Depth_First_Search
+// #Medium #Array #String #Hash_Table #Depth_First_Search #Tree
 // #2024_10_29_Time_139_ms_(95.24%)_Space_82.2_MB_(19.05%)
 
 class Solution {