Update time tag tasks 84-138

ThanhNIT · ThanhNIT · commit e76e2b0acd88 · 2024-11-13T21:03:40.000+07:00
diff --git a/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.java b/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0084_largest_rectangle_in_histogram;
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack
-// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2022_06_20_Time_11_ms_(98.34%)_Space_72.8_MB_(81.14%)
+// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2024_11_13_Time_9_ms_(93.28%)_Space_54.6_MB_(99.95%)
 
 public class Solution {
     public int largestRectangleArea(int[] heights) {
diff --git a/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.java b/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.java
@@ -2,7 +2,7 @@
 
 // #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)
-// #2022_06_21_Time_0_ms_(100.00%)_Space_42.7_MB_(9.33%)
+// #2024_11_13_Time_0_ms_(100.00%)_Space_41.6_MB_(47.93%)
 
 import com_github_leetcode.TreeNode;
 import java.util.ArrayList;
diff --git a/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java b/src/main/java/g0001_0100/s0096_unique_binary_search_trees/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
 // #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
-// #2022_06_21_Time_0_ms_(100.00%)_Space_40.4_MB_(72.43%)
+// #2024_11_13_Time_0_ms_(100.00%)_Space_40.7_MB_(6.57%)
 
 public class Solution {
     public int numTrees(int n) {
diff --git a/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java b/src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java
@@ -3,7 +3,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 #Big_O_Time_O(N)_Space_O(log(N))
-// #2022_06_21_Time_0_ms_(100.00%)_Space_43.4_MB_(72.88%)
+// #2024_11_13_Time_0_ms_(100.00%)_Space_42.9_MB_(95.84%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java b/src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java
@@ -2,7 +2,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
-// #Big_O_Time_O(N)_Space_O(log(N)) #2022_06_22_Time_0_ms_(100.00%)_Space_42.3_MB_(46.67%)
+// #Big_O_Time_O(N)_Space_O(log(N)) #2024_11_13_Time_0_ms_(100.00%)_Space_41.4_MB_(83.38%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java b/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java
@@ -2,7 +2,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
-// #Big_O_Time_O(N)_Space_O(N) #2022_06_22_Time_1_ms_(91.09%)_Space_43.6_MB_(42.50%)
+// #Big_O_Time_O(N)_Space_O(N) #2024_11_13_Time_1_ms_(91.19%)_Space_45.1_MB_(24.35%)
 
 import com_github_leetcode.TreeNode;
 import java.util.ArrayList;
diff --git a/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java b/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
@@ -3,7 +3,7 @@
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
 // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
 // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue
-// #Big_O_Time_O(N)_Space_O(H) #2022_06_22_Time_0_ms_(100.00%)_Space_42.9_MB_(67.03%)
+// #Big_O_Time_O(N)_Space_O(H) #2024_11_13_Time_0_ms_(100.00%)_Space_42.2_MB_(88.11%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java b/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree
 // #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N)
-// #2022_06_22_Time_3_ms_(86.35%)_Space_45.2_MB_(14.09%)
+// #2024_11_13_Time_1_ms_(96.33%)_Space_44.5_MB_(36.49%)
 
 import com_github_leetcode.TreeNode;
 import java.util.HashMap;
diff --git a/src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java b/src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List
 // #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N)
-// #2022_06_23_Time_1_ms_(75.27%)_Space_42.8_MB_(36.48%)
+// #2024_11_13_Time_0_ms_(100.00%)_Space_42.5_MB_(6.71%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java b/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.java
@@ -2,7 +2,7 @@
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
 // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays
-// #Big_O_Time_O(N)_Space_O(1) #2022_06_23_Time_1_ms_(100.00%)_Space_58.9_MB_(93.57%)
+// #Big_O_Time_O(N)_Space_O(1) #2024_11_13_Time_1_ms_(99.78%)_Space_61.8_MB_(27.61%)
 
 public class Solution {
     public int maxProfit(int[] prices) {
diff --git a/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java b/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.java
@@ -2,7 +2,7 @@
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search
 // #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N)
-// #2022_06_23_Time_1_ms_(99.46%)_Space_47.2_MB_(77.68%)
+// #2024_11_13_Time_0_ms_(100.00%)_Space_44.4_MB_(29.91%)
 
 import com_github_leetcode.TreeNode;
 
diff --git a/src/main/java/g0101_0200/s0128_longest_consecutive_sequence/Solution.java b/src/main/java/g0101_0200/s0128_longest_consecutive_sequence/Solution.java
@@ -1,7 +1,7 @@
 package g0101_0200.s0128_longest_consecutive_sequence;
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find
-// #Big_O_Time_O(N_log_N)_Space_O(1) #2022_06_23_Time_18_ms_(91.05%)_Space_64.8_MB_(63.58%)
+// #Big_O_Time_O(N_log_N)_Space_O(1) #2024_11_13_Time_14_ms_(98.89%)_Space_57.1_MB_(77.61%)
 
 import java.util.Arrays;
 
diff --git a/src/main/java/g0101_0200/s0131_palindrome_partitioning/Solution.java b/src/main/java/g0101_0200/s0131_palindrome_partitioning/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 // #Backtracking #Big_O_Time_O(N*2^N)_Space_O(2^N*N)
-// #2022_06_24_Time_16_ms_(65.63%)_Space_194.3_MB_(37.65%)
+// #2024_11_13_Time_7_ms_(98.55%)_Space_56.9_MB_(57.45%)
 
 import java.util.ArrayList;
 import java.util.List;
diff --git a/src/main/java/g0101_0200/s0136_single_number/Solution.java b/src/main/java/g0101_0200/s0136_single_number/Solution.java
@@ -2,7 +2,7 @@
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
 // #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers
-// #Big_O_Time_O(N)_Space_O(1) #2022_06_24_Time_1_ms_(99.97%)_Space_50.9_MB_(35.58%)
+// #Big_O_Time_O(N)_Space_O(1) #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%)
 
 public class Solution {
     public int singleNumber(int[] nums) {
diff --git a/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java b/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List
 // #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N)
-// #2022_06_24_Time_0_ms_(100.00%)_Space_45.5_MB_(56.49%)
+// #2024_11_13_Time_0_ms_(100.00%)_Space_44.1_MB_(92.12%)
 
 import com_github_leetcode.random.Node;
 
