Updated tasks 221-1143

javadev · web-flow · commit 0ca615762757 · 2025-07-25T12:13:54.000+03:00
diff --git a/README.md b/README.md
diff --git a/src/main/python/g0201_0300/s0221_maximal_square/Solution.py b/src/main/python/g0201_0300/s0221_maximal_square/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_09_Time_510_ms_(82.54%)_Space_19.3_MB_(68.21%)
+# #2025_07_25_Time_129_ms_(64.49%)_Space_33.02_MB_(58.33%)
 
 class Solution:
     def maximalSquare(self, matrix: List[List[str]]) -> int:
diff --git a/src/main/python/g0201_0300/s0226_invert_binary_tree/Solution.py b/src/main/python/g0201_0300/s0226_invert_binary_tree/Solution.py
@@ -1,7 +1,7 @@
 # #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_06_09_Time_30_ms_(87.85%)_Space_16.5_MB_(77.12%)
+# #2025_07_25_Time_0_ms_(100.00%)_Space_17.94_MB_(9.36%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.py b/src/main/python/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.py
@@ -1,7 +1,7 @@
 # #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_06_09_Time_44_ms_(61.91%)_Space_19.4_MB_(88.66%)
+# #2025_07_25_Time_0_ms_(100.00%)_Space_21.13_MB_(27.27%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0201_0300/s0234_palindrome_linked_list/Solution.py b/src/main/python/g0201_0300/s0234_palindrome_linked_list/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_09_Time_282_ms_(75.97%)_Space_31.9_MB_(83.09%)
+# #2025_07_25_Time_36_ms_(47.14%)_Space_34.79_MB_(83.78%)
 
 # Definition for singly-linked list.
 # class ListNode:
diff --git a/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py b/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py
@@ -1,7 +1,7 @@
 # #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_06_09_Time_43_ms_(89.34%)_Space_21_MB_(44.04%)
+# #2025_07_25_Time_41_ms_(97.74%)_Space_22.14_MB_(43.54%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py b/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_09_Time_241_ms_(99.65%)_Space_25.5_MB_(94.18%)
+# #Big_O_Time_O(n^2)_Space_O(n) #2025_07_25_Time_15_ms_(97.12%)_Space_23.25_MB_(79.77%)
 
 class Solution:
     def productExceptSelf(self, nums: List[int]) -> List[int]:
diff --git a/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py b/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_08_Time_1093_ms_(66.83%)_Space_32_MB_(94.89%)
+# #2025_07_25_Time_184_ms_(37.84%)_Space_31.28_MB_(63.38%)
 
 from collections import deque
 
diff --git a/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.py b/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_08_Time_130_ms_(91.49%)_Space_22.8_MB_(65.80%)
+# #2025_07_25_Time_143_ms_(64.84%)_Space_24.00_MB_(80.86%)
 
 class Solution:
     def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
diff --git a/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py b/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_08_Time_113_ms_(97.70%)_Space_17.8_MB_(99.81%)
+# #Big_O_Time_O(n)_Space_O(1) #2025_07_25_Time_3_ms_(80.05%)_Space_18.63_MB_(94.75%)
 
 class Solution:
     def moveZeroes(self, nums: List[int]) -> None:
diff --git a/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution.py b/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_08_Time_453_ms_(81.73%)_Space_31.1_MB_(24.78%)
+# #2025_07_25_Time_16_ms_(96.25%)_Space_30.09_MB_(49.05%)
 
 class Solution:
     def findDuplicate(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py b/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py
@@ -1,6 +1,6 @@
 # #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_06_08_Time_351_ms_(89.30%)_Space_38.5_MB_(42.35%)
+# #2025_07_25_Time_131_ms_(72.46%)_Space_40.10_MB_(17.67%)
 
 import heapq
 
diff --git a/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution.py b/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution.py
@@ -1,7 +1,7 @@
 # #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_06_08_Time_58_ms_(96.98%)_Space_16.9_MB_(78.92%)
+# #2025_07_25_Time_11_ms_(78.54%)_Space_18.12_MB_(38.75%)
 
 import bisect
 
diff --git a/src/main/python/g0301_0400/s0322_coin_change/Solution.py b/src/main/python/g0301_0400/s0322_coin_change/Solution.py
@@ -1,7 +1,7 @@
 # #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_06_08_Time_488_ms_(96.38%)_Space_16.9_MB_(86.07%)
+# #2025_07_25_Time_454_ms_(96.33%)_Space_18.19_MB_(69.69%)
 
 class Solution:
     def coinChange(self, coins: List[int], amount: int) -> int:
diff --git a/src/main/python/g0301_0400/s0338_counting_bits/Solution.py b/src/main/python/g0301_0400/s0338_counting_bits/Solution.py
@@ -1,6 +1,6 @@
 # #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
 # #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
-# #2024_06_08_Time_55_ms_(88.80%)_Space_23_MB_(95.35%)
+# #2025_07_25_Time_3_ms_(94.51%)_Space_18.68_MB_(22.83%)
 
 class Solution:
     def countBits(self, num: int) -> List[int]:
diff --git a/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution.py b/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_08_Time_86_ms_(71.64%)_Space_20.7_MB_(94.24%)
+# #Big_O_Time_O(n*log(n))_Space_O(k) #2025_07_25_Time_4_ms_(69.79%)_Space_21.51_MB_(27.28%)
 
 import heapq
 from collections import Counter
diff --git a/src/main/python/g0301_0400/s0394_decode_string/Solution.py b/src/main/python/g0301_0400/s0394_decode_string/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_08_Time_28_ms_(91.14%)_Space_16.5_MB_(41.29%)
+# #2025_07_25_Time_0_ms_(100.00%)_Space_17.56_MB_(97.37%)
 
 class Solution:
     def __init__(self):
diff --git a/src/main/python/g0401_0500/s0416_partition_equal_subset_sum/Solution.py b/src/main/python/g0401_0500/s0416_partition_equal_subset_sum/Solution.py
@@ -1,5 +1,5 @@
 # #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_06_07_Time_550_ms_(64.93%)_Space_16.6_MB_(92.89%)
+# #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_07_25_Time_564_ms_(63.45%)_Space_18.06_MB_(74.36%)
 
 class Solution:
     def canPartition(self, nums: List[int]) -> bool:
diff --git a/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py b/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py
@@ -1,5 +1,6 @@
-# #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_06_07_Time_264_ms_(30.25%)_Space_16.8_MB_(98.67%)
+# #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)
+# #2025_07_25_Time_310_ms_(27.21%)_Space_18.22_MB_(71.08%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.py b/src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.py
@@ -1,7 +1,7 @@
 # #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_06_07_Time_100_ms_(50.22%)_Space_17.6_MB_(97.85%)
+# #2025_07_25_Time_54_ms_(54.80%)_Space_18.16_MB_(94.43%)
 
 from collections import defaultdict
 
diff --git a/src/main/python/g0401_0500/s0494_target_sum/Solution.py b/src/main/python/g0401_0500/s0494_target_sum/Solution.py
@@ -1,5 +1,5 @@
 # #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
-# #2024_06_07_Time_105_ms_(86.96%)_Space_16.7_MB_(80.93%)
+# #2025_07_25_Time_59_ms_(77.59%)_Space_18.11_MB_(61.50%)
 
 class Solution:
     def findTargetSumWays(self, nums: List[int], target: int) -> int:
diff --git a/src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution.py b/src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_07_Time_51_ms_(36.84%)_Space_19.2_MB_(86.39%)
+# #2025_07_25_Time_3_ms_(94.30%)_Space_20.69_MB_(95.89%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0501_0600/s0560_subarray_sum_equals_k/Solution.py b/src/main/python/g0501_0600/s0560_subarray_sum_equals_k/Solution.py
@@ -1,5 +1,5 @@
 # #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_06_07_Time_224_ms_(72.29%)_Space_19.4_MB_(91.64%)
+# #Big_O_Time_O(n)_Space_O(n) #2025_07_25_Time_39_ms_(36.13%)_Space_20.37_MB_(71.80%)
 
 from collections import defaultdict
 
diff --git a/src/main/python/g0601_0700/s0647_palindromic_substrings/Solution.py b/src/main/python/g0601_0700/s0647_palindromic_substrings/Solution.py
@@ -1,5 +1,5 @@
 # #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n)
-# #2024_06_07_Time_167_ms_(49.16%)_Space_16.4_MB_(97.33%)
+# #2025_07_25_Time_141_ms_(40.24%)_Space_17.93_MB_(34.39%)
 
 class Solution:
     def expand(self, a: List[str], l: int, r: int, res: List[int]) -> None:
diff --git a/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py b/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py
@@ -1,6 +1,6 @@
 # #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_06_07_Time_864_ms_(87.84%)_Space_30.8_MB_(64.29%)
+# #2025_07_25_Time_105_ms_(58.04%)_Space_26.59_MB_(95.95%)
 
 class Solution:
     def dailyTemperatures(self, temperatures: List[int]) -> List[int]:
diff --git a/src/main/python/g0701_0800/s0763_partition_labels/Solution.py b/src/main/python/g0701_0800/s0763_partition_labels/Solution.py
@@ -1,5 +1,6 @@
-# #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
-# #Big_O_Time_O(n)_Space_O(1) #2024_06_07_Time_32_ms_(95.28%)_Space_16.4_MB_(98.19%)
+# #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)
+# #2025_07_25_Time_5_ms_(53.34%)_Space_17.62_MB_(84.14%)
 
 class Solution:
     def partitionLabels(self, s: str) -> List[int]:
diff --git a/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py b/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py
@@ -1,7 +1,7 @@
 # #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_06_07_Time_452_ms_(81.00%)_Space_41.6_MB_(77.76%)
+# #2025_07_25_Time_463_ms_(61.43%)_Space_42.65_MB_(76.06%)
 
 class Solution:
     def longestCommonSubsequence(self, text1: str, text2: str) -> int:
