Improved tasks 41-102

javadev · web-flow · commit bee194ffd68b · 2025-03-23T10:45:18.000+02:00
diff --git a/README.md b/README.md
diff --git a/src/main/ts/g0001_0100/s0041_first_missing_positive/solution.ts b/src/main/ts/g0001_0100/s0041_first_missing_positive/solution.ts
@@ -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) #2023_09_29_Time_55_ms_(98.51%)_Space_49.8_MB_(60.20%)
+// #Big_O_Time_O(n)_Space_O(n) #2025_03_23_Time_1_ms_(99.11%)_Space_65.96_MB_(40.18%)
 
 function firstMissingPositive(nums: number[]): number {
     let i = 0
diff --git a/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts b/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts
@@ -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)
-// #2023_09_30_Time_46_ms_(99.52%)_Space_44.4_MB_(97.58%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_57.78_MB_(55.13%)
 
 function trap(height: number[]): number {
     let result = 0
diff --git a/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts b/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts
@@ -1,42 +1,23 @@
 // #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)
-// #2023_09_30_Time_50_ms_(95.93%)_Space_44.9_MB_(65.88%)
+// #2025_03_23_Time_1_ms_(84.27%)_Space_58.46_MB_(28.93%)
 
-function jump(nums: number[]): number { //NOSONAR
-    let minJmp = new Array(nums.length)
-    if (nums.length === 1) return 0
-    let prevIndex = 0
-    minJmp[prevIndex] = 0
-    while (prevIndex < nums.length - 1) {
-        let nextMaxJmpTo = nums[prevIndex] + prevIndex
-        let prevIndexJmp = minJmp[prevIndex]
+function jump(nums: number[]): number {
+    let minJump = 0,
+        farthest = 0,
+        currentEnd = 0
+    for (let i = 0; i < nums.length - 1; i++) {
+        farthest = Math.max(farthest, i + nums[i])
+        // If we've reached the end of the current jump range
+        if (i === currentEnd) {
+            minJump++
+            currentEnd = farthest
 
-        let farthestJumpVal = -1
-        let farthestJumpIndex = -1
-        for (let i = nextMaxJmpTo; ; i--) {
-            if (i >= nums.length) {
-                continue
-            }
-            if (i === nums.length - 1) {
-                return prevIndexJmp + 1
-            }
-            if (minJmp[i] != undefined) {
-                break
-            }
-            minJmp[i] = prevIndexJmp + 1
-            let curmaxTo = nums[i] + i
-            if (farthestJumpVal < curmaxTo) {
-                farthestJumpVal = curmaxTo
-                farthestJumpIndex = i
-            }
+            if (currentEnd >= nums.length - 1) break
         }
-        if (farthestJumpIndex === -1) {
-            return -1
-        }
-        prevIndex = farthestJumpIndex
     }
-    return minJmp[nums.length - 1]
+    return minJump
 }
 
 export { jump }
diff --git a/src/main/ts/g0001_0100/s0046_permutations/solution.ts b/src/main/ts/g0001_0100/s0046_permutations/solution.ts
@@ -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!)
-// #2023_09_30_Time_56_ms_(96.26%)_Space_45.7_MB_(55.35%)
+// #2025_03_23_Time_1_ms_(84.44%)_Space_60.84_MB_(26.93%)
 
 function permute(nums: number[]): number[][] {
     const result: number[][] = []
diff --git a/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts b/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts
@@ -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)
-// #2023_09_30_Time_45_ms_(95.31%)_Space_44.4_MB_(48.24%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_57.37_MB_(17.79%)
 
 /*
  Do not return anything, modify matrix in-place instead.
diff --git a/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts b/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts
@@ -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)
-// #2023_09_30_Time_93_ms_(97.29%)_Space_52_MB_(99.08%)
+// #2025_03_23_Time_27_ms_(78.99%)_Space_68.93_MB_(28.40%)
 
 function groupAnagrams(strs: string[]): string[][] {
     if (strs.length === 1) return [strs]
diff --git a/src/main/ts/g0001_0100/s0051_n_queens/solution.ts b/src/main/ts/g0001_0100/s0051_n_queens/solution.ts
@@ -1,5 +1,5 @@
 // #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N)
-// #2023_09_30_Time_57_ms_(93.84%)_Space_45_MB_(83.56%)
+// #2025_03_23_Time_6_ms_(95.85%)_Space_59.90_MB_(33.61%)
 
 function solveNQueens(n: number): string[][] {
     const result: string[][] = []
diff --git a/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts b/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts
@@ -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)
-// #2023_09_30_Time_66_ms_(90.36%)_Space_51.9_MB_(80.92%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_65.50_MB_(44.96%)
 
 function maxSubArray(nums: number[]): number {
     let curSum: number = nums[0]
diff --git a/src/main/ts/g0001_0100/s0055_jump_game/solution.ts b/src/main/ts/g0001_0100/s0055_jump_game/solution.ts
@@ -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)
-// #2023_09_30_Time_58_ms_(91.95%)_Space_47.4_MB_(70.79%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_59.92_MB_(51.18%)
 
 function canJump(nums: number[]): boolean {
     let availableSteps = nums[0]
diff --git a/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts b/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts
@@ -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)
-// #2023_10_01_Time_84_ms_(92.06%)_Space_49.9_MB_(69.16%)
+// #2025_03_23_Time_7_ms_(87.99%)_Space_66.00_MB_(36.16%)
 
 function merge(intervals: number[][]): number[][] {
     let result = []
diff --git a/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts b/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts
@@ -1,19 +1,18 @@
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
 // #Combinatorics #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)
-// #2023_10_01_Time_40_ms_(98.97%)_Space_42.8_MB_(72.52%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_55.15_MB_(43.54%)
 
 function uniquePaths(m: number, n: number): number {
-    const factorialize = (x: number) => {
-        if (x <= 1) return 1
-        let res = x
-        while (x > 1) {
-            x--
-            res *= x
+    let aboveRow = Array(n).fill(1)
+    for (let row = 1; row < m; row++) {
+        let currentRow = Array(n).fill(1)
+        for (let col = 1; col < n; col++) {
+            currentRow[col] = currentRow[col - 1] + aboveRow[col]
         }
-        return res
+        aboveRow = currentRow
     }
-    return factorialize(m + n - 2) / factorialize(m - 1) / factorialize(n - 1)
+    return aboveRow[n - 1]
 }
 
 export { uniquePaths }
diff --git a/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts b/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts
@@ -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) #2023_10_01_Time_48_ms_(99.67%)_Space_44.5_MB_(90.16%)
+// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_03_23_Time_4_ms_(70.73%)_Space_59.31_MB_(26.29%)
 
 function minPathSum(grid: number[][]): number {
     let [m, n] = [grid.length, grid[0].length]
diff --git a/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts b/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts
@@ -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) #2023_10_01_Time_44_ms_(94.58%)_Space_42.4_MB_(73.09%)
+// #Big_O_Time_O(n)_Space_O(n) #2025_03_23_Time_0_ms_(100.00%)_Space_56.23_MB_(5.15%)
 
 function climbStairs(n: number, memo: Record<string, number> = {}): number {
     if (n in memo) return memo[n]
diff --git a/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts b/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts
@@ -1,7 +1,7 @@
 // #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
 // #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)
-// #2025_02_15_Time_9_ms_(93.59%)_Space_57.68_MB_(49.82%)
+// #2025_03_23_Time_6_ms_(93.83%)_Space_61.09_MB_(45.68%)
 
 function minDistance(word1: string, word2: string): number {
     const memo: number[][] = new Array(word1.length + 1).fill(0).map((_) => [])
diff --git a/src/main/ts/g0001_0100/s0073_set_matrix_zeroes/solution.ts b/src/main/ts/g0001_0100/s0073_set_matrix_zeroes/solution.ts
@@ -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)
-// #2023_10_01_Time_61_ms_(97.66%)_Space_45.9_MB_(30.73%)
+// #2025_03_23_Time_4_ms_(50.63%)_Space_61.42_MB_(6.15%)
 
 /*
  Do not return anything, modify matrix in-place instead.
diff --git a/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts b/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts
@@ -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)
-// #2023_10_01_Time_45_ms_(96.82%)_Space_44.3_MB_(43.77%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_54.50_MB_(46.86%)
 
 function searchMatrix(matrix: number[][], target: number): boolean {
     const [m, n] = [matrix.length, matrix[0].length]
diff --git a/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts b/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts
@@ -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)
-// #2023_10_02_Time_43_ms_(97.41%)_Space_42.5_MB_(85.34%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_56.04_MB_(26.80%)
 
 const sortColors = (nums: number[]) => {
     let i = 0
diff --git a/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts b/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts
@@ -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) #2023_10_02_Time_82_ms_(82.17%)_Space_46.2_MB_(81.89%)
+// #Big_O_Time_O(s.length())_Space_O(1) #2025_03_23_Time_20_ms_(90.35%)_Space_58.72_MB_(57.91%)
 
 function minWindow(s: string, t: string): string { //NOSONAR
     const map: Map<string, number> = new Map()
diff --git a/src/main/ts/g0001_0100/s0078_subsets/solution.ts b/src/main/ts/g0001_0100/s0078_subsets/solution.ts
@@ -1,8 +1,8 @@
 // #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) #2023_10_02_Time_50_ms_(94.61%)_Space_44.8_MB_(75.83%)
+// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_03_23_Time_0_ms_(100.00%)_Space_58.49_MB_(41.68%)
 
-const subsets = (nums: number[]): number[][] => {
+function subsets(nums: number[]): number[][] {
     const sets: number[][] = [[]]
     for (const num of nums) sets.push(...sets.map((set) => [...set, num]))
     return sets
diff --git a/src/main/ts/g0001_0100/s0079_word_search/solution.ts b/src/main/ts/g0001_0100/s0079_word_search/solution.ts
@@ -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) #2023_10_03_Time_327_ms_(95.78%)_Space_43.4_MB_(84.98%)
+// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_03_23_Time_243_ms_(85.30%)_Space_56.58_MB_(58.26%)
 
 function exist(board: string[][], word: string): boolean {
     if (word.length === 0) return false
diff --git a/src/main/ts/g0001_0100/s0084_largest_rectangle_in_histogram/solution.ts b/src/main/ts/g0001_0100/s0084_largest_rectangle_in_histogram/solution.ts
@@ -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) #2023_10_03_Time_78_ms_(92.44%)_Space_56.8_MB_(85.29%)
+// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_03_23_Time_15_ms_(72.81%)_Space_72.66_MB_(37.28%)
 
 function largestRectangleArea(heights: number[]): number {
     let stack = []
diff --git a/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts b/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts
@@ -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)
-// #2023_10_03_Time_45_ms_(97.30%)_Space_42.9_MB_(96.73%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_54.69_MB_(46.13%)
 
 import { TreeNode } from '../../com_github_leetcode/treenode'
 
diff --git a/src/main/ts/g0001_0100/s0096_unique_binary_search_trees/solution.ts b/src/main/ts/g0001_0100/s0096_unique_binary_search_trees/solution.ts
@@ -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)
-// #2023_10_03_Time_45_ms_(96.00%)_Space_42.9_MB_(25.33%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_55.21_MB_(33.33%)
 
 function numTrees(n: number): number {
     const uniqueCount = new Array(n + 1).fill(0)
diff --git a/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts b/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts
@@ -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))
-// #2023_10_03_Time_51_ms_(98.35%)_Space_47.3_MB_(61.68%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_60.76_MB_(21.74%)
 
 import { TreeNode } from '../../com_github_leetcode/treenode'
 
diff --git a/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts b/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts
@@ -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))
-// #2023_10_04_Time_49_ms_(98.54%)_Space_45_MB_(59.02%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_58.35_MB_(25.66%)
 
 import { TreeNode } from '../../com_github_leetcode/treenode'
 
diff --git a/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts b/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts
@@ -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)
-// #2023_10_04_Time_60_ms_(97.47%)_Space_47_MB_(77.89%)
+// #2025_03_23_Time_0_ms_(100.00%)_Space_59.70_MB_(51.83%)
 
 import { TreeNode } from '../../com_github_leetcode/treenode'
 
