Updated tasks 41-102

javadev · javadev · commit 75a1054b4097 · 2025-07-24T14:41:46.000+03:00
diff --git a/src/main/python/g0001_0100/s0041_first_missing_positive/Solution.py b/src/main/python/g0001_0100/s0041_first_missing_positive/Solution.py
@@ -1,5 +1,5 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_08_Time_334_ms_(98.05%)_Space_34.7_MB_(28.20%)
+# #Big_O_Time_O(n)_Space_O(n) #2025_07_24_Time_19_ms_(93.81%)_Space_34.68_MB_(19.66%)
 
 class Solution:
     def firstMissingPositive(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0001_0100/s0042_trapping_rain_water/Solution.py b/src/main/python/g0001_0100/s0042_trapping_rain_water/Solution.py
@@ -1,7 +1,7 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers
 # #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers
 # #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_08_Time_93_ms_(87.70%)_Space_18.5_MB_(68.72%)
+# #2025_07_24_Time_11_ms_(71.16%)_Space_19.22_MB_(68.64%)
 
 class Solution:
     def trap(self, height: List[int]) -> int:
diff --git a/src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py b/src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
 # #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
 # #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_08_Time_89_ms_(99.30%)_Space_17.7_MB_(41.04%)
+# #2025_07_24_Time_8_ms_(57.34%)_Space_18.40_MB_(92.28%)
 
 class Solution:
     def jump(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0001_0100/s0046_permutations/Solution.py b/src/main/python/g0001_0100/s0046_permutations/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
 # #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
 # #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!)
-# #2024_06_08_Time_28_ms_(98.67%)_Space_16.6_MB_(93.71%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_18.04_MB_(32.82%)
 
 class Solution:
     def permute(self, nums: List[int]) -> List[List[int]]:
diff --git a/src/main/python/g0001_0100/s0048_rotate_image/Solution.py b/src/main/python/g0001_0100/s0048_rotate_image/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix
 # #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix
 # #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
-# #2024_06_08_Time_26_ms_(98.93%)_Space_16.5_MB_(91.88%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_17.66_MB_(91.44%)
 
 class Solution:
     def rotate(self, matrix: List[List[int]]) -> None:
diff --git a/src/main/python/g0001_0100/s0049_group_anagrams/Solution.py b/src/main/python/g0001_0100/s0049_group_anagrams/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting
 # #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings
 # #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
-# #2024_06_08_Time_79_ms_(93.60%)_Space_19.6_MB_(76.55%)
+# #2025_07_24_Time_11_ms_(82.75%)_Space_20.85_MB_(56.49%)
 
 from collections import defaultdict
 
diff --git a/src/main/python/g0001_0100/s0051_n_queens/Solution.py b/src/main/python/g0001_0100/s0051_n_queens/Solution.py
@@ -1,5 +1,5 @@
 # #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N)
-# #2024_06_08_Time_31_ms_(99.90%)_Space_16.9_MB_(70.82%)
+# #2025_07_24_Time_6_ms_(98.12%)_Space_18.42_MB_(15.31%)
 
 class Solution:
     def solveNQueens(self, n: int) -> List[List[str]]:
diff --git a/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py b/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 # #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
 # #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_08_Time_501_ms_(83.84%)_Space_30.7_MB_(91.05%)
+# #2025_07_24_Time_50_ms_(77.23%)_Space_32.78_MB_(39.19%)
 
 class Solution:
     def maxSubArray(self, nums: List[int]) -> int:
diff --git a/src/main/python/g0001_0100/s0055_jump_game/Solution.py b/src/main/python/g0001_0100/s0055_jump_game/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy
 # #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays
 # #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_08_Time_333_ms_(97.58%)_Space_17.8_MB_(82.03%)
+# #2025_07_24_Time_12_ms_(85.38%)_Space_18.61_MB_(41.98%)
 
 class Solution:
     def canJump(self, nums: List[int]) -> bool:
diff --git a/src/main/python/g0001_0100/s0056_merge_intervals/Solution.py b/src/main/python/g0001_0100/s0056_merge_intervals/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
 # #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
 # #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
-# #2024_06_08_Time_109_ms_(98.07%)_Space_20.5_MB_(84.05%)
+# #2025_07_24_Time_7_ms_(72.98%)_Space_20.89_MB_(89.16%)
 
 class Solution:
     def merge(self, intervals: List[List[int]]) -> List[List[int]]:
diff --git a/src/main/python/g0001_0100/s0062_unique_paths/Solution.py b/src/main/python/g0001_0100/s0062_unique_paths/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
 # #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
 # #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
-# #Big_O_Time_O(m*n)_Space_O(m*n) #2024_06_08_Time_24_ms_(98.19%)_Space_16.4_MB_(78.68%)
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2025_07_24_Time_0_ms_(100.00%)_Space_17.83_MB_(45.92%)
 
 class Solution:
     def uniquePaths(self, m: int, n: int) -> int:
@@ -14,4 +14,3 @@ def uniquePaths(self, m: int, n: int) -> int:
             for j in range(1, n):
                 dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
         return dp[m - 1][n - 1]
-       
diff --git a/src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py b/src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
 # #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
-# #Big_O_Time_O(m*n)_Space_O(m*n) #2024_06_08_Time_72_ms_(97.25%)_Space_18.2_MB_(74.63%)
+# #Big_O_Time_O(m*n)_Space_O(m*n) #2025_07_24_Time_15_ms_(60.38%)_Space_20.01_MB_(64.76%)
 
 class Solution:
     def minPathSum(self, grid: List[List[int]]) -> int:
diff --git a/src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py b/src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
 # #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
 # #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
-# #Big_O_Time_O(n)_Space_O(n) #2024_06_08_Time_29_ms_(87.37%)_Space_16.4_MB_(74.67%)
+# #Big_O_Time_O(n)_Space_O(n) #2025_07_24_Time_0_ms_(100.00%)_Space_17.79_MB_(48.58%)
 
 class Solution:
     def climbStairs(self, n: int) -> int:
diff --git a/src/main/python/g0001_0100/s0072_edit_distance/Solution.py b/src/main/python/g0001_0100/s0072_edit_distance/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
 # #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
 # #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
-# #2024_06_08_Time_60_ms_(98.17%)_Space_18.5_MB_(81.62%)
+# #2025_07_24_Time_23_ms_(98.84%)_Space_19.79_MB_(77.91%)
 
 class Solution:
     def solve(self, str1, i, str2, j, dp):
diff --git a/src/main/python/g0001_0100/s0073_set_matrix_zeroes/Solution.py b/src/main/python/g0001_0100/s0073_set_matrix_zeroes/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
 # #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1)
-# #2024_06_09_Time_93_ms_(94.48%)_Space_17.4_MB_(67.69%)
+# #2025_07_24_Time_3_ms_(71.07%)_Space_18.35_MB_(78.72%)
 
 class Solution:
     def setZeroes(self, matrix: List[List[int]]) -> None:
diff --git a/src/main/python/g0001_0100/s0074_search_a_2d_matrix/Solution.py b/src/main/python/g0001_0100/s0074_search_a_2d_matrix/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array
 # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search
 # #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1)
-# #2024_06_09_Time_35_ms_(97.66%)_Space_17_MB_(69.27%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_18.07_MB_(93.02%)
 
 class Solution:
     def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
diff --git a/src/main/python/g0001_0100/s0075_sort_colors/Solution.py b/src/main/python/g0001_0100/s0075_sort_colors/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
 # #Data_Structure_II_Day_2_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_09_Time_31_ms_(90.70%)_Space_16.4_MB_(80.54%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_17.89_MB_(33.05%)
 
 class Solution:
     def sortColors(self, nums: List[int]) -> None:
diff --git a/src/main/python/g0001_0100/s0076_minimum_window_substring/Solution.py b/src/main/python/g0001_0100/s0076_minimum_window_substring/Solution.py
@@ -1,6 +1,6 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
 # #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window
-# #Big_O_Time_O(s.length())_Space_O(1) #2024_06_09_Time_92_ms_(92.59%)_Space_17.1_MB_(93.76%)
+# #Big_O_Time_O(s.length())_Space_O(1) #2025_07_24_Time_59_ms_(88.78%)_Space_18.10_MB_(93.29%)
 
 class Solution:
     def minWindow(self, s: str, t: str) -> str:
diff --git a/src/main/python/g0001_0100/s0078_subsets/Solution.py b/src/main/python/g0001_0100/s0078_subsets/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation #Backtracking
 # #Algorithm_II_Day_9_Recursion_Backtracking #Udemy_Backtracking/Recursion
-# #Big_O_Time_O(2^n)_Space_O(n*2^n) #2024_06_09_Time_30_ms_(92.66%)_Space_16.7_MB_(74.16%)
+# #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_07_24_Time_0_ms_(100.00%)_Space_18.05_MB_(21.18%)
 
 from itertools import combinations
 
diff --git a/src/main/python/g0001_0100/s0079_word_search/Solution.py b/src/main/python/g0001_0100/s0079_word_search/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking
 # #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
-# #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_06_09_Time_619_ms_(95.31%)_Space_16.6_MB_(20.49%)
+# #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_07_24_Time_623_ms_(94.85%)_Space_17.84_MB_(65.07%)
 
 class Solution:
     def exist(self, board: List[List[str]], word: str) -> bool:
diff --git a/src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.py b/src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.py
@@ -1,5 +1,5 @@
 # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack
-# #Big_O_Time_O(n_log_n)_Space_O(log_n) #2024_06_09_Time_644_ms_(90.89%)_Space_30.7_MB_(64.32%)
+# #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_07_24_Time_63_ms_(99.53%)_Space_29.12_MB_(95.20%)
 
 class Solution:
     def largestRectangleArea(self, heights: List[int]) -> int:
diff --git a/src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.py b/src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.py
@@ -1,6 +1,6 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
 # #Stack #Data_Structure_I_Day_10_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
-# #2024_06_09_Time_28_ms_(91.67%)_Space_16.5_MB_(69.09%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_17.90_MB_(12.04%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0001_0100/s0096_unique_binary_search_trees/Solution.py b/src/main/python/g0001_0100/s0096_unique_binary_search_trees/Solution.py
@@ -1,6 +1,6 @@
 # #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
 # #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
-# #2024_06_09_Time_30_ms_(84.13%)_Space_16.4_MB_(71.22%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_17.82_MB_(32.26%)
 
 class Solution:
     def numTrees(self, n: int) -> int:
diff --git a/src/main/python/g0001_0100/s0098_validate_binary_search_tree/Solution.py b/src/main/python/g0001_0100/s0098_validate_binary_search_tree/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
 # #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree
 # #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N))
-# #2024_06_09_Time_38_ms_(77.48%)_Space_18.3_MB_(75.64%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_19.66_MB_(89.79%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0101_0200/s0101_symmetric_tree/Solution.py b/src/main/python/g0101_0200/s0101_symmetric_tree/Solution.py
@@ -1,7 +1,7 @@
 # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
 # #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree
 # #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
-# #2024_06_09_Time_35_ms_(71.46%)_Space_16.6_MB_(14.05%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_17.74_MB_(83.76%)
 
 # Definition for a binary tree node.
 # class TreeNode:
diff --git a/src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.py b/src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.py
@@ -1,7 +1,7 @@
 # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree
 # #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue
 # #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N)
-# #2024_06_09_Time_31_ms_(95.63%)_Space_17.2_MB_(85.23%)
+# #2025_07_24_Time_0_ms_(100.00%)_Space_18.34_MB_(87.01%)
 
 # Definition for a binary tree node.
 # class TreeNode:
