Updated tasks 221-1143

javadev · web-flow · commit f78b6206dc23 · 2025-06-16T11:06:38.000+03:00
diff --git a/LeetCodeNet/G0201_0300/S0221_maximal_square/Solution.cs b/LeetCodeNet/G0201_0300/S0221_maximal_square/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0221_maximal_square {
 
 // #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
 // #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n)
-// #2024_01_10_Time_199_ms_(36.75%)_Space_59.5_MB_(84.44%)
+// #2025_06_15_Time_3_ms_(96.90%)_Space_67.76_MB_(80.23%)
 
 public class Solution {
     public int MaximalSquare(char[][] matrix) {
diff --git a/LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs b/LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0201_0300.S0226_invert_binary_tree {
 // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
 // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue
 // #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
-// #2024_01_10_Time_58_ms_(94.38%)_Space_40.3_MB_(8.09%)
+// #2025_06_15_Time_0_ms_(100.00%)_Space_41.66_MB_(64.48%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0201_0300/S0230_kth_smallest_element_in_a_bst/Solution.cs b/LeetCodeNet/G0201_0300/S0230_kth_smallest_element_in_a_bst/Solution.cs
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0201_0300.S0230_kth_smallest_element_in_a_bst {
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
 // #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree
 // #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
-// #2024_01_10_Time_69_ms_(98.79%)_Space_45.2_MB_(12.59%)
+// #2025_06_15_Time_0_ms_(100.00%)_Space_46.22_MB_(89.61%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0201_0300/S0234_palindrome_linked_list/Solution.cs b/LeetCodeNet/G0201_0300/S0234_palindrome_linked_list/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0234_palindrome_linked_list {
 
 // #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion
 // #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
-// #2024_01_10_Time_306_ms_(31.81%)_Space_66.1_MB_(33.64%)
+// #2025_06_16_Time_4_ms_(60.29%)_Space_66.97_MB_(96.10%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs b/LeetCodeNet/G0201_0300/S0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0201_0300.S0236_lowest_common_ancestor_of_a_binary_tree {
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
 // #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)
-// #2024_01_10_Time_76_ms_(98.04%)_Space_45.9_MB_(13.60%)
+// #2025_06_16_Time_93_ms_(68.06%)_Space_47.24_MB_(38.78%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs b/LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0238_product_of_array_except_self {
 
 // #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) #2024_01_10_Time_141_ms_(94.24%)_Space_58.3_MB_(10.01%)
+// #Big_O_Time_O(n^2)_Space_O(n) #2025_06_16_Time_1_ms_(100.00%)_Space_66.76_MB_(65.40%)
 
 public class Solution {
     public int[] ProductExceptSelf(int[] nums) {
diff --git a/LeetCodeNet/G0201_0300/S0239_sliding_window_maximum/Solution.cs b/LeetCodeNet/G0201_0300/S0239_sliding_window_maximum/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0239_sliding_window_maximum {
 
 // #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue
 // #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
-// #2024_01_07_Time_493_ms_(46.05%)_Space_133.5_MB_(14.15%)
+// #2025_06_16_Time_32_ms_(94.92%)_Space_83.28_MB_(70.68%)
 
 using System;
 using System.Collections.Generic;
diff --git a/LeetCodeNet/G0201_0300/S0240_search_a_2d_matrix_ii/Solution.cs b/LeetCodeNet/G0201_0300/S0240_search_a_2d_matrix_ii/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0240_search_a_2d_matrix_ii {
 
 // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer
 // #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
-// #2024_01_07_Time_142_ms_(60.76%)_Space_54_MB_(79.75%)
+// #2025_06_16_Time_156_ms_(77.90%)_Space_55.51_MB_(19.48%)
 
 public class Solution {
     public bool SearchMatrix(int[][] matrix, int target) {
diff --git a/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs b/LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0283_move_zeroes {
 
 // #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) #2024_01_07_Time_133_ms_(96.30%)_Space_57_MB_(17.07%)
+// #Big_O_Time_O(n)_Space_O(1) #2025_06_16_Time_1_ms_(96.12%)_Space_58.35_MB_(71.18%)
 
 public class Solution {
     public void MoveZeroes(int[] nums) {
diff --git a/LeetCodeNet/G0201_0300/S0287_find_the_duplicate_number/Solution.cs b/LeetCodeNet/G0201_0300/S0287_find_the_duplicate_number/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0287_find_the_duplicate_number {
 
 // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
 // #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
-// #2024_01_07_Time_257_ms_(30.11%)_Space_70.4_MB_(7.03%)
+// #2025_06_16_Time_1_ms_(100.00%)_Space_72.10_MB_(32.30%)
 
 public class Solution {
     public int FindDuplicate(int[] nums) {
diff --git a/LeetCodeNet/G0201_0300/S0295_find_median_from_data_stream/MedianFinder.cs b/LeetCodeNet/G0201_0300/S0295_find_median_from_data_stream/MedianFinder.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0201_0300.S0295_find_median_from_data_stream {
 
 // #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
 // #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n)
-// #2024_01_11_Time_658_ms_(24.88%)_Space_144_MB_(5.64%)
+// #2025_06_16_Time_191_ms_(41.28%)_Space_111.30_MB_(45.74%)
 
 using System;
 using System.Collections.Generic;
diff --git a/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs b/LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0201_0300.S0300_longest_increasing_subsequence {
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
 // #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
 // #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n)
-// #2024_01_07_Time_80_ms_(89.11%)_Space_41.9_MB_(36.71%)
+// #2025_06_16_Time_2_ms_(93.82%)_Space_43.33_MB_(52.97%)
 
 public class Solution {
     public int LengthOfLIS(int[] nums) {
diff --git a/LeetCodeNet/G0301_0400/S0322_coin_change/Solution.cs b/LeetCodeNet/G0301_0400/S0322_coin_change/Solution.cs
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0301_0400.S0322_coin_change {
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
 // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
 // #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount)
-// #2024_01_07_Time_78_ms_(90.63%)_Space_44.2_MB_(33.38%)
+// #2025_06_16_Time_12_ms_(97.87%)_Space_45.88_MB_(62.94%)
 
 public class Solution {
     public int CoinChange(int[] coins, int amount) {
diff --git a/LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs b/LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0301_0400.S0338_counting_bits {
 
 // #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
 // #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
-// #2024_01_07_Time_67_ms_(98.82%)_Space_42.1_MB_(22.68%)
+// #2025_06_16_Time_0_ms_(100.00%)_Space_43.52_MB_(53.08%)
 
 public class Solution {
     public int[] CountBits(int num) {
diff --git a/LeetCodeNet/G0301_0400/S0347_top_k_frequent_elements/Solution.cs b/LeetCodeNet/G0301_0400/S0347_top_k_frequent_elements/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0301_0400.S0347_top_k_frequent_elements {
 
 // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting
 // #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
-// #Big_O_Time_O(n*log(n))_Space_O(k) #2024_01_07_Time_125_ms_(95.29%)_Space_50.6_MB_(12.11%)
+// #Big_O_Time_O(n*log(n))_Space_O(k) #2025_06_16_Time_7_ms_(75.70%)_Space_52.02_MB_(18.24%)
 
 using System;
 using System.Collections.Generic;
diff --git a/LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs b/LeetCodeNet/G0301_0400/S0394_decode_string/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0301_0400.S0394_decode_string {
 
 // #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)
-// #2024_01_07_Time_44_ms_(99.55%)_Space_38.2_MB_(26.91%)
+// #2025_06_16_Time_0_ms_(100.00%)_Space_39.97_MB_(63.08%)
 
 using System.Text;
 
diff --git a/LeetCodeNet/G0401_0500/S0416_partition_equal_subset_sum/Solution.cs b/LeetCodeNet/G0401_0500/S0416_partition_equal_subset_sum/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0401_0500.S0416_partition_equal_subset_sum {
 
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
-// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2024_01_05_Time_95_ms_(97.38%)_Space_42.9_MB_(84.72%)
+// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_06_16_Time_22_ms_(82.19%)_Space_44.17_MB_(96.67%)
 
 public class Solution {
     public bool CanPartition(int[] nums) {
diff --git a/LeetCodeNet/G0401_0500/S0437_path_sum_iii/Solution.cs b/LeetCodeNet/G0401_0500/S0437_path_sum_iii/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.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) #2024_01_05_Time_76_ms_(97.16%)_Space_42.8_MB_(29.79%)
+// #Big_O_Time_O(n)_Space_O(n) #2025_06_16_Time_10_ms_(66.33%)_Space_44.34_MB_(85.37%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0401_0500/S0438_find_all_anagrams_in_a_string/Solution.cs b/LeetCodeNet/G0401_0500/S0438_find_all_anagrams_in_a_string/Solution.cs
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0401_0500.S0438_find_all_anagrams_in_a_string {
 // #Medium #Top_100_Liked_Questions #String #Hash_Table #Sliding_Window
 // #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12
 // #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1)
-// #2024_01_07_Time_103_ms_(97.89%)_Space_50.2_MB_(32.49%)
+// #2025_06_16_Time_3_ms_(97.66%)_Space_50.66_MB_(96.88%)
 
 using System;
 using System.Collections.Generic;
diff --git a/LeetCodeNet/G0401_0500/S0494_target_sum/Solution.cs b/LeetCodeNet/G0401_0500/S0494_target_sum/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0401_0500.S0494_target_sum {
 
 // #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
-// #2024_01_07_Time_62_ms_(99.32%)_Space_43.8_MB_(47.12%)
+// #2025_06_16_Time_6_ms_(85.88%)_Space_45.47_MB_(56.49%)
 
 using System;
 using System.Collections.Generic;
diff --git a/LeetCodeNet/G0501_0600/S0543_diameter_of_binary_tree/Solution.cs b/LeetCodeNet/G0501_0600/S0543_diameter_of_binary_tree/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0501_0600.S0543_diameter_of_binary_tree {
 
 // #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
 // #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
-// #2024_01_07_Time_74_ms_(84.67%)_Space_42.6_MB_(8.90%)
+// #2025_06_16_Time_0_ms_(100.00%)_Space_46.36_MB_(46.34%)
 
 using LeetCodeNet.Com_github_leetcode;
 
diff --git a/LeetCodeNet/G0501_0600/S0560_subarray_sum_equals_k/Solution.cs b/LeetCodeNet/G0501_0600/S0560_subarray_sum_equals_k/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0501_0600.S0560_subarray_sum_equals_k {
 
 // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
-// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_135_ms_(46.56%)_Space_50.6_MB_(20.87%)
+// #Big_O_Time_O(n)_Space_O(n) #2025_06_16_Time_12_ms_(90.27%)_Space_52.19_MB_(67.86%)
 
 using System.Collections.Generic;
 
diff --git a/LeetCodeNet/G0601_0700/S0647_palindromic_substrings/Solution.cs b/LeetCodeNet/G0601_0700/S0647_palindromic_substrings/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.G0601_0700.S0647_palindromic_substrings {
 
 // #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n)
-// #2024_01_07_Time_48_ms_(92.55%)_Space_37.2_MB_(34.47%)
+// #2025_06_16_Time_10_ms_(72.48%)_Space_38.84_MB_(83.72%)
 
 public class Solution {
     private void Expand(char[] a, int l, int r, int[] res) {
diff --git a/LeetCodeNet/G0701_0800/S0739_daily_temperatures/Solution.cs b/LeetCodeNet/G0701_0800/S0739_daily_temperatures/Solution.cs
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0701_0800.S0739_daily_temperatures {
 
 // #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)
-// #2024_01_07_Time_376_ms_(44.29%)_Space_71.9_MB_(21.96%)
+// #2025_06_16_Time_6_ms_(98.90%)_Space_66.59_MB_(99.02%)
 
 public class Solution {
     public int[] DailyTemperatures(int[] temperatures) {
diff --git a/LeetCodeNet/G0701_0800/S0763_partition_labels/Solution.cs b/LeetCodeNet/G0701_0800/S0763_partition_labels/Solution.cs
@@ -1,7 +1,7 @@
 namespace LeetCodeNet.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) #2024_01_07_Time_82_ms_(98.72%)_Space_45.6_MB_(10.26%)
+// #Big_O_Time_O(n)_Space_O(1) #2025_06_16_Time_2_ms_(86.67%)_Space_46.51_MB_(87.11%)
 
 using System.Collections.Generic;
 
diff --git a/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs b/LeetCodeNet/G1101_1200/S1143_longest_common_subsequence/Solution.cs
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G1101_1200.S1143_longest_common_subsequence {
 // #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
 // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19
 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m)
-// #2024_01_07_Time_59_ms_(90.45%)_Space_41.3_MB_(54.32%)
+// #2025_06_16_Time_14_ms_(69.42%)_Space_43.41_MB_(84.62%)
 
 public class Solution {
     public int LongestCommonSubsequence(string text1, string text2) {
diff --git a/README.md b/README.md
