Update time tag for tasks 22-48

ThanhNIT · ThanhNIT · commit afdf0e77b8cb · 2024-11-10T10:12:01.000+07:00
diff --git a/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java b/src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 // #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
-// #Big_O_Time_O(2^n)_Space_O(n) #2023_08_09_Time_0_ms_(100.00%)_Space_41.7_MB_(97.17%)
+// #Big_O_Time_O(2^n)_Space_O(n) #2024_11_10_Time_0_ms_(100.00%)_Space_42.8_MB_(84.67%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java b/src/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java
@@ -2,7 +2,7 @@
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
 // #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
-// #2023_08_09_Time_1_ms_(100.00%)_Space_42.9_MB_(98.59%)
+// #2024_11_10_Time_1_ms_(99.86%)_Space_44.1_MB_(79.93%)
 
 import com_github_leetcode.ListNode;
 
diff --git a/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java b/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_12_Linked_List
 // #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
-// #2023_08_09_Time_0_ms_(100.00%)_Space_40.7_MB_(10.83%)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_41.4_MB_(20.29%)
 
 import com_github_leetcode.ListNode;
 
diff --git a/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java b/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java
@@ -2,7 +2,7 @@
 
 // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
 // #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
-// #2023_08_09_Time_0_ms_(100.00%)_Space_43_MB_(88.08%)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_44.4_MB_(33.90%)
 
 import com_github_leetcode.ListNode;
 
diff --git a/src/main/java/g0001_0100/s0031_next_permutation/Solution.java b/src/main/java/g0001_0100/s0031_next_permutation/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0031_next_permutation;
 
 // #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1)
-// #2023_08_09_Time_0_ms_(100.00%)_Space_42_MB_(90.28%)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_43_MB_(39.33%)
 
 public class Solution {
     public void nextPermutation(int[] nums) {
diff --git a/src/main/java/g0001_0100/s0032_longest_valid_parentheses/Solution.java b/src/main/java/g0001_0100/s0032_longest_valid_parentheses/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0032_longest_valid_parentheses;
 
 // #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1)
-// #2023_08_09_Time_1_ms_(100.00%)_Space_41.4_MB_(85.22%)
+// #2024_11_10_Time_1_ms_(99.74%)_Space_42.2_MB_(80.93%)
 
 public class Solution {
     public int longestValidParentheses(String s) {
diff --git a/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java b/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java
@@ -3,7 +3,7 @@
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
 // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search
 // #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
-// #2023_08_09_Time_0_ms_(100.00%)_Space_40.6_MB_(92.43%)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(21.10%)
 
 public class Solution {
     public int search(int[] nums, int target) {
diff --git a/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java b/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
 // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
-// #2023_08_09_Time_0_ms_(100.00%)_Space_44.3_MB_(89.57%)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_45.7_MB_(82.78%)
 
 public class Solution {
     public int[] searchRange(int[] nums, int target) {
diff --git a/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java b/src/main/java/g0001_0100/s0035_search_insert_position/Solution.java
@@ -2,7 +2,7 @@
 
 // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
 // #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
-// #2023_08_09_Time_0_ms_(100.00%)_Space_43.3_MB_(58.21%)
+// #2024_11_10_Time_0_ms_(100.00%)_Space_43_MB_(40.42%)
 
 public class Solution {
     public int searchInsert(int[] nums, int target) {
diff --git a/src/main/java/g0001_0100/s0039_combination_sum/Solution.java b/src/main/java/g0001_0100/s0039_combination_sum/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
 // #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
-// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_08_09_Time_1_ms_(100.00%)_Space_43.6_MB_(90.84%)
+// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_11_10_Time_1_ms_(99.99%)_Space_44.5_MB_(51.73%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g0001_0100/s0041_first_missing_positive/Solution.java b/src/main/java/g0001_0100/s0041_first_missing_positive/Solution.java
@@ -1,30 +1,24 @@
 package g0001_0100.s0041_first_missing_positive;
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
-// #Big_O_Time_O(n)_Space_O(n) #2023_08_11_Time_2_ms_(57.59%)_Space_59.2_MB_(51.48%)
+// #Big_O_Time_O(n)_Space_O(n) #2024_11_10_Time_1_ms_(100.00%)_Space_57.5_MB_(31.18%)
 
 public class Solution {
     public int firstMissingPositive(int[] nums) {
         for (int i = 0; i < nums.length; i++) {
-            if (nums[i] <= 0 || nums[i] > nums.length || nums[i] == i + 1) {
-                continue;
+            while (nums[i] <= nums.length && nums[i] > 0 && nums[nums[i] - 1] != nums[i]) {
+                int temp = nums[nums[i] - 1];
+                nums[nums[i] - 1] = nums[i];
+                nums[i] = temp;
             }
-            dfs(nums, nums[i]);
         }
+
         for (int i = 0; i < nums.length; i++) {
             if (nums[i] != i + 1) {
                 return i + 1;
             }
         }
-        return nums.length + 1;
-    }
 
-    private void dfs(int[] nums, int val) {
-        if (val <= 0 || val > nums.length || val == nums[val - 1]) {
-            return;
-        }
-        int temp = nums[val - 1];
-        nums[val - 1] = val;
-        dfs(nums, temp);
+        return nums.length + 1;
     }
 }
diff --git a/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java b/src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java
@@ -2,7 +2,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
-// #Big_O_Time_O(n)_Space_O(1) #2023_08_11_Time_0_ms_(100.00%)_Space_44.3_MB_(62.40%)
+// #Big_O_Time_O(n)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_46.2_MB_(57.86%)
 
 public class Solution {
     public int trap(int[] height) {
diff --git a/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java b/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java
@@ -2,25 +2,25 @@
 
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
 // #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
-// #Big_O_Time_O(n)_Space_O(1) #2023_08_11_Time_2_ms_(49.02%)_Space_44.7_MB_(52.72%)
+// #Big_O_Time_O(n)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_44.9_MB_(75.73%)
 
-public class Solution {
+class Solution {
     public int jump(int[] nums) {
-        int length = 0;
-        int maxLength = 0;
-        int minJump = 0;
-        for (int i = 0; i < nums.length - 1; ++i) {
-            length--;
-            maxLength--;
-            maxLength = Math.max(maxLength, nums[i]);
-            if (length <= 0) {
-                length = maxLength;
-                minJump++;
-            }
-            if (length >= nums.length - i - 1) {
-                return minJump;
+        if (nums.length == 1) return 0;
+        return minJumps(nums, 0, 0);
+    }
+
+    private static int minJumps(int[] nums, int currIndex, int jumpStatus) {
+        if (currIndex + nums[currIndex] >= nums.length - 1) return jumpStatus + 1;
+        int nextIndex = currIndex + 1;
+        int distanceLeft = (nums.length - 1 - (currIndex + 1)) - nums[currIndex + 1];
+        for (int i = currIndex + 2; i <= (currIndex + nums[currIndex]); i++) {
+            int tempDistanceLeft = (nums.length - 1 - i) - nums[i];
+            if (distanceLeft > tempDistanceLeft) {
+                distanceLeft = tempDistanceLeft;
+                nextIndex = i;
             }
         }
-        return minJump;
+        return minJumps(nums, nextIndex, jumpStatus + 1);
     }
 }
diff --git a/src/main/java/g0001_0100/s0046_permutations/Solution.java b/src/main/java/g0001_0100/s0046_permutations/Solution.java
@@ -3,7 +3,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 #Big_O_Time_O(n*n!)_Space_O(n+n!)
-// #2023_08_11_Time_1_ms_(95.07%)_Space_43.7_MB_(87.98%)
+// #2024_11_10_Time_1_ms_(94.08%)_Space_45.1_MB_(6.84%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g0001_0100/s0048_rotate_image/Solution.java b/src/main/java/g0001_0100/s0048_rotate_image/Solution.java
@@ -2,7 +2,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
-// #Big_O_Time_O(n^2)_Space_O(1) #2023_08_11_Time_0_ms_(100.00%)_Space_41.5_MB_(34.96%)
+// #Big_O_Time_O(n^2)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(43.71%)
 
 public class Solution {
     public void rotate(int[][] matrix) {
