javadev · javadev · Jan 23, 2024 · Jan 23, 2024
diff --git a/src/main/java/g0001_0100/s0001_two_sum/Solution.java b/src/main/java/g0001_0100/s0001_two_sum/Solution.java
@@ -2,6 +2,7 @@
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
 // #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
+// #2024_01_04_Time_2_ms_(85.97%)_Space_44.8_MB_(15.45%)
 
 import java.util.HashMap;
 import java.util.Map;

diff --git a/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java b/src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
 // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
-// #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
+// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_01_04_Time_1_ms_(100.00%)_Space_44.4_MB_(16.63%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java b/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
 // #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
-// #Big_O_Time_O(n)_Space_O(1)
+// #Big_O_Time_O(n)_Space_O(1) #2024_01_04_Time_2_ms_(99.52%)_Space_43.6_MB_(75.37%)
 
 public class Solution {
     public int lengthOfLongestSubstring(String s) {

diff --git a/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java b/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java
@@ -1,7 +1,7 @@
 package g0001_0100.s0004_median_of_two_sorted_arrays;
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
-// #Big_O_Time_O(log(min(N,M)))_Space_O(1)
+// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2024_01_04_Time_1_ms_(100.00%)_Space_46.5_MB_(7.80%)
 
 @SuppressWarnings("java:S2234")
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java b/src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
@@ -3,6 +3,7 @@
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
 // #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
 // #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
+// #2024_01_04_Time_7_ms_(96.96%)_Space_42.7_MB_(66.12%)
 
 public class Solution {
     public String longestPalindrome(String s) {

diff --git a/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java b/src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java
@@ -2,6 +2,7 @@
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
 // #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
+// #2024_01_04_Time_1_ms_(100.00%)_Space_42.1_MB_(29.26%)
 
 public class Solution {
     private Boolean[][] cache;

diff --git a/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java b/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java
@@ -2,6 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
 // #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
+// #2023_08_09_Time_3_ms_(94.75%)_Space_56.2_MB_(5.82%)
 
 public class Solution {
     public int maxArea(int[] height) {

diff --git a/src/main/java/g0001_0100/s0015_3sum/Solution.java b/src/main/java/g0001_0100/s0015_3sum/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
 // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers
-// #Big_O_Time_O(n*log(n))_Space_O(n^2)
+// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_08_09_Time_27_ms_(97.93%)_Space_51.7_MB_(23.15%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java b/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java
@@ -2,7 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
 // #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
-// #Big_O_Time_O(4^n)_Space_O(n)
+// #Big_O_Time_O(4^n)_Space_O(n) #2023_08_09_Time_0_ms_(100.00%)_Space_41.3_MB_(58.39%)
 
 import java.util.ArrayList;
 import java.util.Collections;

diff --git a/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java b/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java
@@ -2,6 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List
 // #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
+// #2023_08_09_Time_0_ms_(100.00%)_Space_40.4_MB_(88.65%)
 
 import com_github_leetcode.ListNode;
 

diff --git a/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java b/src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java
@@ -2,6 +2,7 @@
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
 // #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
+// #2023_08_09_Time_2_ms_(90.49%)_Space_40.1_MB_(98.14%)
 
 import java.util.Stack;
 

diff --git a/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java b/src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
@@ -3,6 +3,7 @@
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
 // #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
 // #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
+// #2023_08_09_Time_0_ms_(100.00%)_Space_40.9_MB_(99.19%)
 
 import com_github_leetcode.ListNode;
 

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)
+// #Big_O_Time_O(2^n)_Space_O(n) #2023_08_09_Time_0_ms_(100.00%)_Space_41.7_MB_(97.17%)
 
 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,6 +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%)
 
 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,6 +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%)
 
 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,6 +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%)
 
 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,6 +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%)
 
 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,6 +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%)
 
 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,6 +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%)
 
 public class Solution {
     public int search(int[] nums, int target) {

diff --git a/...va/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java b/...va/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java
@@ -2,6 +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%)
 
 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,6 +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%)
 
 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)
+// #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%)
 
 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,7 +1,7 @@
 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)
+// #Big_O_Time_O(n)_Space_O(n) #2023_08_11_Time_2_ms_(57.59%)_Space_59.2_MB_(51.48%)
 
 public class Solution {
     public int firstMissingPositive(int[] nums) {

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)
+// #Big_O_Time_O(n)_Space_O(1) #2023_08_11_Time_0_ms_(100.00%)_Space_44.3_MB_(62.40%)
 
 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,7 +2,7 @@
 
 // #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)
+// #Big_O_Time_O(n)_Space_O(1) #2023_08_11_Time_2_ms_(49.02%)_Space_44.7_MB_(52.72%)
 
 public class Solution {
     public int jump(int[] nums) {

diff --git a/src/main/java/g0001_0100/s0046_permutations/Solution.java b/src/main/java/g0001_0100/s0046_permutations/Solution.java
@@ -3,6 +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%)
 
 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)
+// #Big_O_Time_O(n^2)_Space_O(1) #2023_08_11_Time_0_ms_(100.00%)_Space_41.5_MB_(34.96%)
 
 public class Solution {
     public void rotate(int[][] matrix) {

diff --git a/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java b/src/main/java/g0001_0100/s0049_group_anagrams/Solution.java
@@ -2,7 +2,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
-// #Big_O_Time_O(n*k_log_k)_Space_O(n)
+// #Big_O_Time_O(n*k_log_k)_Space_O(n) #2023_08_11_Time_6_ms_(92.28%)_Space_46.4_MB_(98.50%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g0001_0100/s0051_n_queens/Solution.java b/src/main/java/g0001_0100/s0051_n_queens/Solution.java
@@ -1,6 +1,7 @@
 package g0001_0100.s0051_n_queens;
 
 // #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N)
+// #2023_08_11_Time_1_ms_(100.00%)_Space_43.6_MB_(97.17%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java b/src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java
@@ -3,6 +3,7 @@
 // #Easy #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 #Big_O_Time_O(n)_Space_O(1)
+// #2023_08_11_Time_1_ms_(100.00%)_Space_57.7_MB_(90.58%)
 
 public class Solution {
     public int maxSubArray(int[] nums) {

diff --git a/src/main/java/g0001_0100/s0055_jump_game/Solution.java b/src/main/java/g0001_0100/s0055_jump_game/Solution.java
@@ -2,7 +2,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
-// #Big_O_Time_O(n)_Space_O(1)
+// #Big_O_Time_O(n)_Space_O(1) #2023_08_11_Time_2_ms_(79.47%)_Space_44.8_MB_(22.14%)
 
 public class Solution {
     public boolean canJump(int[] nums) {

diff --git a/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java b/src/main/java/g0001_0100/s0056_merge_intervals/Solution.java
@@ -2,7 +2,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
-// #Big_O_Time_O(n_log_n)_Space_O(n)
+// #Big_O_Time_O(n_log_n)_Space_O(n) #2023_08_11_Time_8_ms_(96.27%)_Space_45.2_MB_(90.13%)
 
 import java.util.ArrayList;
 import java.util.Arrays;

diff --git a/src/main/java/g0001_0100/s0062_unique_paths/Solution.java b/src/main/java/g0001_0100/s0062_unique_paths/Solution.java
@@ -3,6 +3,7 @@
 // #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_08_11_Time_0_ms_(100.00%)_Space_39.2_MB_(67.74%)
 
 public class Solution {
     public int uniquePaths(int m, int n) {

diff --git a/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java b/src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java
@@ -2,6 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
 // #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
+// #2023_08_11_Time_0_ms_(100.00%)_Space_44_MB_(58.56%)
 
 public class Solution {
     public int minPathSum(int[][] grid) {

diff --git a/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java b/src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java
@@ -3,6 +3,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 #Big_O_Time_O(n)_Space_O(n)
+// #2023_08_11_Time_0_ms_(100.00%)_Space_39.2_MB_(71.51%)
 
 public class Solution {
     public int climbStairs(int n) {

diff --git a/src/main/java/g0001_0100/s0072_edit_distance/Solution.java b/src/main/java/g0001_0100/s0072_edit_distance/Solution.java
@@ -3,6 +3,7 @@
 // #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
 // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
 // #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
+// #2023_08_11_Time_4_ms_(90.13%)_Space_41.8_MB_(99.78%)
 
 @SuppressWarnings("java:S2234")
 public class Solution {

diff --git a/src/main/java/g0001_0100/s0073_set_matrix_zeroes/Solution.java b/src/main/java/g0001_0100/s0073_set_matrix_zeroes/Solution.java
@@ -2,6 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
 // #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1)
+// #2023_08_11_Time_1_ms_(79.07%)_Space_44.4_MB_(94.19%)
 
 public class Solution {
     // Approach: Use first row and first column for storing whether in future

diff --git a/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java b/src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java
@@ -3,6 +3,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 #Big_O_Time_O(endRow+endCol)_Space_O(1)
+// #2023_08_11_Time_0_ms_(100.00%)_Space_40.9_MB_(71.91%)
 
 public class Solution {
     public boolean searchMatrix(int[][] matrix, int target) {

diff --git a/src/main/java/g0001_0100/s0075_sort_colors/Solution.java b/src/main/java/g0001_0100/s0075_sort_colors/Solution.java
@@ -2,6 +2,7 @@
 
 // #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_08_11_Time_0_ms_(100.00%)_Space_41_MB_(50.59%)
 
 public class Solution {
     public void sortColors(int[] nums) {

diff --git a/src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java b/src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java
@@ -2,6 +2,7 @@
 
 // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
 // #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1)
+// #2023_08_11_Time_2_ms_(99.94%)_Space_43.6_MB_(93.87%)
 
 public class Solution {
     public String minWindow(String s, String t) {

diff --git a/src/main/java/g0001_0100/s0078_subsets/Solution.java b/src/main/java/g0001_0100/s0078_subsets/Solution.java
@@ -2,7 +2,7 @@
 
 // #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)
+// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2023_08_11_Time_1_ms_(70.60%)_Space_41.8_MB_(71.73%)
 
 import java.util.ArrayList;
 import java.util.List;

diff --git a/src/main/java/g0001_0100/s0079_word_search/Solution.java b/src/main/java/g0001_0100/s0079_word_search/Solution.java
@@ -2,6 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking
 // #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n)
+// #2023_08_11_Time_157_ms_(78.97%)_Space_40.5_MB_(84.41%)
 
 public class Solution {
     private boolean backtrace(

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)
+// #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%)
 
 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,6 +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%)
 
 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,6 +2,7 @@
 
 // #Medium #Top_100_Liked_Questions #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%)
 
 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,6 +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%)
 
 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))
+// #Big_O_Time_O(N)_Space_O(log(N)) #2022_06_22_Time_0_ms_(100.00%)_Space_42.3_MB_(46.67%)
 
 import com_github_leetcode.TreeNode;