Imroved tasks 3, 4, 3310, 3319, 3327, 3331

javadev · web-flow · commit 3b534026a3c9 · 2024-11-07T08:12:28.000+02:00
diff --git a/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java b/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
@@ -2,7 +2,8 @@
 
 // #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) #2024_01_04_Time_2_ms_(99.52%)_Space_43.6_MB_(75.37%)
+// #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
+// #2024_01_04_Time_2_ms_(99.52%)_Space_43.6_MB_(75.37%)
 
 public class Solution {
     public int lengthOfLongestSubstring(String s) {
diff --git a/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java b/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java
@@ -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) #2024_01_04_Time_1_ms_(100.00%)_Space_46.5_MB_(7.80%)
+// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #AI_can_be_used_to_solve_the_task
+// #2024_01_04_Time_1_ms_(100.00%)_Space_46.5_MB_(7.80%)
 
 @SuppressWarnings("java:S2234")
 public class Solution {
diff --git a/src/main/java/g3301_3400/s3310_remove_methods_from_project/Solution.java b/src/main/java/g3301_3400/s3310_remove_methods_from_project/Solution.java
@@ -1,6 +1,6 @@
 package g3301_3400.s3310_remove_methods_from_project;
 
-// #Medium #Graph #Depth_First_Search #Breadth_First_Search
+// #Medium #Depth_First_Search #Breadth_First_Search #Graph
 // #2024_10_08_Time_41_ms_(99.76%)_Space_154.8_MB_(55.29%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g3301_3400/s3319_k_th_largest_perfect_subtree_size_in_binary_tree/Solution.java b/src/main/java/g3301_3400/s3319_k_th_largest_perfect_subtree_size_in_binary_tree/Solution.java
@@ -1,6 +1,6 @@
 package g3301_3400.s3319_k_th_largest_perfect_subtree_size_in_binary_tree;
 
-// #Medium #Sorting #Tree #Binary_Tree #Depth_First_Search
+// #Medium #Sorting #Depth_First_Search #Tree #Binary_Tree
 // #2024_10_15_Time_10_ms_(87.48%)_Space_45.3_MB_(50.46%)
 
 import com_github_leetcode.TreeNode;
diff --git a/src/main/java/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/Solution.java b/src/main/java/g3301_3400/s3327_check_if_dfs_strings_are_palindromes/Solution.java
@@ -1,6 +1,6 @@
 package g3301_3400.s3327_check_if_dfs_strings_are_palindromes;
 
-// #Hard #Array #String #Hash_Table #Tree #Hash_Function #Depth_First_Search
+// #Hard #Array #String #Hash_Table #Depth_First_Search #Tree #Hash_Function
 // #2024_10_22_Time_159_ms_(90.40%)_Space_93.9_MB_(80.80%)
 
 import java.util.ArrayList;
diff --git a/src/main/java/g3301_3400/s3331_find_subtree_sizes_after_changes/Solution.java b/src/main/java/g3301_3400/s3331_find_subtree_sizes_after_changes/Solution.java
@@ -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_166_ms_(52.73%)_Space_86.3_MB_(8.86%)
 
 import java.util.ArrayList;
