diff --git a/src/main/java/g0001_0100/s0001_two_sum/Solution.java b/src/main/java/g0001_0100/s0001_two_sum/Solution.java index 4c716f6..7c6321c 100644 --- 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 index 0c709a4..57a4f0e 100644 --- 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 index 483cabb..b6b1deb 100644 --- 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 index dc478f9..a744595 100644 --- 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 index c88addc..01fa356 100644 --- 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 index 67425bc..96827ab 100644 --- 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 index dcd58ac..d7cffcc 100644 --- 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 index 3004dfa..71beab5 100644 --- 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 index 1c106b3..46bcc79 100644 --- 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 index c1fc829..0d8b75f 100644 --- 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 index 769b098..9df3906 100644 --- 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 index c5ed46a..20e1046 100644 --- 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 index a4baa57..7a89c13 100644 --- 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 index fd5af1f..ba7be88 100644 --- 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 index 67e929b..11e0d4d 100644 --- 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 index d34f627..acc306c 100644 --- 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 index 5e97bcb..5df1412 100644 --- 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 index 76674b3..89a313a 100644 --- 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 index 3f08e53..732b96a 100644 --- 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/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 index e90446b..6501932 100644 --- 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,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 index 19e5967..29430a9 100644 --- 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 index bae08e9..46297ed 100644 --- 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 index d3f5d3e..3b4c042 100644 --- 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 index 078f391..f853ebc 100644 --- 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 index 3328537..81e31a7 100644 --- 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 index 537e64e..18943b5 100644 --- 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 index 1959420..79c98b0 100644 --- 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 index 27c8bd5..ca80a13 100644 --- 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 index a64a1c9..b782e2d 100644 --- 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 index 933bdd3..a11e531 100644 --- 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 index badc6d8..c56c0a1 100644 --- 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 index f179013..4515508 100644 --- 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 index e945c80..5d17eab 100644 --- 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 index 09199f0..4d9fc66 100644 --- 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 index cfe64ce..ae31151 100644 --- 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 index 27324d5..471752c 100644 --- 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 index 9f67e4b..3860b03 100644 --- 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 index 68aa9fd..4378f55 100644 --- 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 index 159763b..53272c1 100644 --- 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 index 347b015..cc9db5e 100644 --- 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 index 99fa552..329dc19 100644 --- 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 index a6cd56b..d055a50 100644 --- 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 index c3db827..2b1a2fb 100644 --- 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 index 5c16041..8020f22 100644 --- 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 index 6836f81..7ba53c2 100644 --- 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 index f892810..ff8d54d 100644 --- 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 index 4c98488..023e1fb 100644 --- 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; 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 index bfc8f2c..a91f379 100644 --- 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) +// #Big_O_Time_O(N)_Space_O(N) #2022_06_22_Time_1_ms_(91.09%)_Space_43.6_MB_(42.50%) 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 index 3ad61bb..cab658f 100644 --- 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) +// #Big_O_Time_O(N)_Space_O(H) #2022_06_22_Time_0_ms_(100.00%)_Space_42.9_MB_(67.03%) 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 index c5a6736..2e0d7da 100644 --- 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,6 +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%) 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 index 810c6cf..b9059ce 100644 --- 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,6 +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%) 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 index 184db74..85278aa 100644 --- 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) +// #Big_O_Time_O(N)_Space_O(1) #2022_06_23_Time_1_ms_(100.00%)_Space_58.9_MB_(93.57%) 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 index d32c0be..733efe1 100644 --- 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,6 +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%) 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 index 441b8f5..86bf4f5 100644 --- 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) +// #Big_O_Time_O(N_log_N)_Space_O(1) #2022_06_23_Time_18_ms_(91.05%)_Space_64.8_MB_(63.58%) 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 index 8547b70..1001300 100644 --- a/src/main/java/g0101_0200/s0131_palindrome_partitioning/Solution.java +++ b/src/main/java/g0101_0200/s0131_palindrome_partitioning/Solution.java @@ -2,6 +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%) 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 index b1aeee1..fffa201 100644 --- 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) +// #Big_O_Time_O(N)_Space_O(1) #2022_06_24_Time_1_ms_(99.97%)_Space_50.9_MB_(35.58%) 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 index 2bc664b..bf4be9f 100644 --- 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,6 +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%) import com_github_leetcode.random.Node; diff --git a/src/main/java/g0101_0200/s0139_word_break/Solution.java b/src/main/java/g0101_0200/s0139_word_break/Solution.java index b70c9c6..8f62cbf 100644 --- a/src/main/java/g0101_0200/s0139_word_break/Solution.java +++ b/src/main/java/g0101_0200/s0139_word_break/Solution.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming // #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) +// #2022_06_24_Time_2_ms_(97.08%)_Space_42.1_MB_(90.92%) import java.util.HashSet; import java.util.List; diff --git a/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java b/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java index e574b58..72066f4 100644 --- a/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java +++ b/src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java @@ -2,6 +2,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) +// #2022_06_24_Time_0_ms_(100.00%)_Space_45.5_MB_(68.52%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java b/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java index 99d5e41..559cb95 100644 --- a/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java +++ b/src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java @@ -2,7 +2,7 @@ // #Medium #Top_100_Liked_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_II_Day_10_Linked_List #Level_1_Day_4_Linked_List #Udemy_Linked_List -// #Big_O_Time_O(N)_Space_O(1) +// #Big_O_Time_O(N)_Space_O(1) #2022_06_24_Time_0_ms_(100.00%)_Space_42.3_MB_(98.70%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java b/src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java index 8854734..791b202 100644 --- a/src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java +++ b/src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List // #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) +// #2022_06_24_Time_87_ms_(50.80%)_Space_125.2_MB_(58.73%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g0101_0200/s0148_sort_list/Solution.java b/src/main/java/g0101_0200/s0148_sort_list/Solution.java index 02464f3..2f6953f 100644 --- a/src/main/java/g0101_0200/s0148_sort_list/Solution.java +++ b/src/main/java/g0101_0200/s0148_sort_list/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List // #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) +// #2022_06_24_Time_12_ms_(85.82%)_Space_76_MB_(43.84%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java b/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java index cd2c30d..f683ba4 100644 --- a/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java +++ b/src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java @@ -2,7 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Dynamic_Programming_I_Day_6 #Level_2_Day_13_Dynamic_Programming #Udemy_Dynamic_Programming -// #Big_O_Time_O(N)_Space_O(1) +// #Big_O_Time_O(N)_Space_O(1) #2022_06_25_Time_0_ms_(100.00%)_Space_42.7_MB_(82.46%) public class Solution { public int maxProduct(int[] arr) { diff --git a/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java b/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java index b3b9e51..5f23c4d 100644 --- a/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java +++ b/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search // #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) +// #2022_06_25_Time_0_ms_(100.00%)_Space_43.3_MB_(6.36%) public class Solution { private int findMinUtil(int[] nums, int l, int r) { diff --git a/src/main/java/g0101_0200/s0155_min_stack/MinStack.java b/src/main/java/g0101_0200/s0155_min_stack/MinStack.java index e6fc02b..ebc3646 100644 --- a/src/main/java/g0101_0200/s0155_min_stack/MinStack.java +++ b/src/main/java/g0101_0200/s0155_min_stack/MinStack.java @@ -2,7 +2,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) +// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) #2022_06_25_Time_3_ms_(100.00%)_Space_44.3_MB_(85.39%) public class MinStack { private static class Node { diff --git a/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java b/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java index bc9510a..64ca25c 100644 --- a/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java +++ b/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.java @@ -2,6 +2,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_II_Day_11_Linked_List #Udemy_Linked_List #Big_O_Time_O(M+N)_Space_O(1) +// #2022_06_25_Time_1_ms_(99.68%)_Space_55.1_MB_(63.42%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0101_0200/s0169_majority_element/Solution.java b/src/main/java/g0101_0200/s0169_majority_element/Solution.java index 355b58b..285f70e 100644 --- a/src/main/java/g0101_0200/s0169_majority_element/Solution.java +++ b/src/main/java/g0101_0200/s0169_majority_element/Solution.java @@ -2,7 +2,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) +// #Big_O_Time_O(n)_Space_O(1) #2022_06_25_Time_1_ms_(100.00%)_Space_45.5_MB_(97.51%) public class Solution { public int majorityElement(int[] arr) { diff --git a/src/main/java/g0101_0200/s0189_rotate_array/Solution.java b/src/main/java/g0101_0200/s0189_rotate_array/Solution.java index 0dcbc7a..5c221ad 100644 --- a/src/main/java/g0101_0200/s0189_rotate_array/Solution.java +++ b/src/main/java/g0101_0200/s0189_rotate_array/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers // #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) +// #2022_06_27_Time_0_ms_(100.00%)_Space_58_MB_(96.22%) public class Solution { private void reverse(int[] nums, int l, int r) { diff --git a/src/main/java/g0101_0200/s0198_house_robber/Solution.java b/src/main/java/g0101_0200/s0198_house_robber/Solution.java index 2438b84..1aeaeb7 100644 --- a/src/main/java/g0101_0200/s0198_house_robber/Solution.java +++ b/src/main/java/g0101_0200/s0198_house_robber/Solution.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 // #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) +// #2022_06_28_Time_0_ms_(100.00%)_Space_39.9_MB_(85.30%) public class Solution { public int rob(int[] nums) { diff --git a/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java b/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java index f6c5728..741435a 100644 --- a/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java +++ b/src/main/java/g0101_0200/s0200_number_of_islands/Solution.java @@ -4,7 +4,7 @@ // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) +// #Big_O_Time_O(M*N)_Space_O(M*N) #2022_06_28_Time_3_ms_(97.76%)_Space_57.5_MB_(41.23%) public class Solution { public int numIslands(char[][] grid) { diff --git a/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java b/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java index 0941074..5758564 100644 --- a/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java +++ b/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java @@ -3,6 +3,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking // #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) +// #2022_06_28_Time_0_ms_(100.00%)_Space_43.9_MB_(7.98%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0201_0300/s0207_course_schedule/Solution.java b/src/main/java/g0201_0300/s0207_course_schedule/Solution.java index 6d93fca..cee89e4 100644 --- a/src/main/java/g0201_0300/s0207_course_schedule/Solution.java +++ b/src/main/java/g0201_0300/s0207_course_schedule/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search // #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) +// #2022_06_28_Time_3_ms_(97.58%)_Space_48.2_MB_(49.51%) import java.util.ArrayList; diff --git a/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java b/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java index d27b041..fd0432c 100644 --- a/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java +++ b/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie // #Level_2_Day_16_Design #Udemy_Trie_and_Heap // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) +// #2022_06_28_Time_34_ms_(99.90%)_Space_51_MB_(94.92%) @SuppressWarnings("java:S1104") public class Trie { diff --git a/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java b/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java index 543226c..7c0c927 100644 --- a/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java +++ b/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java @@ -2,7 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue // #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Big_O_Time_O(n*log(n))_Space_O(log(n)) +// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2022_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%) import java.util.Arrays; diff --git a/src/main/java/g0201_0300/s0221_maximal_square/Solution.java b/src/main/java/g0201_0300/s0221_maximal_square/Solution.java index e0a1c2f..813897f 100644 --- a/src/main/java/g0201_0300/s0221_maximal_square/Solution.java +++ b/src/main/java/g0201_0300/s0221_maximal_square/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix // #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n) +// #2022_07_04_Time_7_ms_(72.35%)_Space_59.5_MB_(10.55%) public class Solution { public int maximalSquare(char[][] matrix) { diff --git a/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java b/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java index 705e4e9..a5fe94b 100644 --- a/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java +++ b/src/main/java/g0201_0300/s0226_invert_binary_tree/Solution.java @@ -2,7 +2,7 @@ // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_07_04_Time_0_ms_(100.00%)_Space_42_MB_(20.73%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java b/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java index e6e555d..546fb9a 100644 --- a/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java +++ b/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.java @@ -2,7 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_07_04_Time_1_ms_(78.91%)_Space_45.3_MB_(58.87%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java b/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java index 0a83faa..fcdf6ed 100644 --- a/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java +++ b/src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java @@ -2,6 +2,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List // #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) +// #2022_07_04_Time_6_ms_(76.07%)_Space_97.6_MB_(56.14%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java b/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java index 59cece4..9ad99ad 100644 --- a/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java +++ b/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +// #2022_07_04_Time_10_ms_(56.51%)_Space_47.4_MB_(45.84%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java b/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java index db27834..d30a46a 100644 --- a/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java +++ b/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum // #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n) +// #2022_07_04_Time_1_ms_(100.00%)_Space_50.8_MB_(85.60%) public class Solution { public int[] productExceptSelf(int[] nums) { diff --git a/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java b/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java index ae5c312..f3a6de1 100644 --- a/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java +++ b/src/main/java/g0201_0300/s0239_sliding_window_maximum/Solution.java @@ -2,6 +2,7 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue // #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k) +// #2022_07_04_Time_58_ms_(52.28%)_Space_145_MB_(50.60%) import java.util.LinkedList; diff --git a/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java b/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java index 2099975..316af70 100644 --- a/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java +++ b/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.java @@ -2,7 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Matrix // #Divide_and_Conquer #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 -// #Big_O_Time_O(n+m)_Space_O(1) +// #Big_O_Time_O(n+m)_Space_O(1) #2022_07_04_Time_7_ms_(86.73%)_Space_58.4_MB_(9.95%) public class Solution { public boolean searchMatrix(int[][] matrix, int target) { diff --git a/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java b/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java index 2fd84ed..7b23fae 100644 --- a/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java +++ b/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java @@ -2,7 +2,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers // #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays -// #Big_O_Time_O(n)_Space_O(1) +// #Big_O_Time_O(n)_Space_O(1) #2022_07_06_Time_2_ms_(79.54%)_Space_55.7_MB_(5.98%) public class Solution { public void moveZeroes(int[] nums) { diff --git a/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java b/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java index 9402a7a..90274a8 100644 --- a/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java +++ b/src/main/java/g0201_0300/s0287_find_the_duplicate_number/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers // #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) +// #2022_07_06_Time_2_ms_(99.82%)_Space_61.1_MB_(83.92%) public class Solution { public int findDuplicate(int[] nums) { diff --git a/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java b/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java index 62346a3..9bb2850 100644 --- a/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java +++ b/src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java @@ -2,6 +2,7 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design // #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n) +// #2022_07_06_Time_151_ms_(80.24%)_Space_125.2_MB_(44.11%) import java.util.PriorityQueue; diff --git a/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java b/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java index de64dd5..318c619 100644 --- a/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java +++ b/src/main/java/g0201_0300/s0300_longest_increasing_subsequence/Solution.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 // #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +// #2022_07_06_Time_3_ms_(98.63%)_Space_44.3_MB_(60.27%) public class Solution { public int lengthOfLIS(int[] nums) { diff --git a/src/main/java/g0301_0400/s0322_coin_change/Solution.java b/src/main/java/g0301_0400/s0322_coin_change/Solution.java index 38f8422..87cac6b 100644 --- a/src/main/java/g0301_0400/s0322_coin_change/Solution.java +++ b/src/main/java/g0301_0400/s0322_coin_change/Solution.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 // #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +// #2022_07_09_Time_17_ms_(91.77%)_Space_41.8_MB_(95.50%) public class Solution { public int coinChange(int[] coins, int amount) { diff --git a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java index 976d569..026396d 100644 --- a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java +++ b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java @@ -1,7 +1,7 @@ package g0301_0400.s0338_counting_bits; // #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) +// #Big_O_Time_O(num)_Space_O(num) #2022_07_10_Time_2_ms_(86.73%)_Space_48.3_MB_(31.59%) public class Solution { public int[] countBits(int num) { diff --git a/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java b/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java index 3713223..a95143c 100644 --- a/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java +++ b/src/main/java/g0301_0400/s0347_top_k_frequent_elements/Solution.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting // #Heap_Priority_Queue #Counting #Divide_and_Conquer #Quickselect #Bucket_Sort // #Data_Structure_II_Day_20_Heap_Priority_Queue #Big_O_Time_O(n*log(n))_Space_O(k) +// #2022_07_11_Time_9_ms_(97.93%)_Space_48.5_MB_(83.34%) import java.util.Arrays; import java.util.PriorityQueue; diff --git a/src/main/java/g0301_0400/s0394_decode_string/Solution.java b/src/main/java/g0301_0400/s0394_decode_string/Solution.java index 0477d9e..b92aa46 100644 --- a/src/main/java/g0301_0400/s0394_decode_string/Solution.java +++ b/src/main/java/g0301_0400/s0394_decode_string/Solution.java @@ -1,7 +1,7 @@ package g0301_0400.s0394_decode_string; // #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_07_15_Time_1_ms_(87.68%)_Space_41.2_MB_(83.30%) public class Solution { private int i = 0; diff --git a/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java b/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java index d82e752..80df83f 100644 --- a/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java +++ b/src/main/java/g0401_0500/s0416_partition_equal_subset_sum/Solution.java @@ -1,7 +1,7 @@ package g0401_0500.s0416_partition_equal_subset_sum; // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming -// #Big_O_Time_O(n*sums)_Space_O(n*sums) +// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2022_12_29_Time_27_ms_(94.53%)_Space_41.8_MB_(95.29%) public class Solution { public boolean canPartition(int[] nums) { diff --git a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java index a8d3366..bd3e723 100644 --- a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java +++ b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java @@ -1,7 +1,7 @@ package g0401_0500.s0437_path_sum_iii; // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_07_16_Time_18_ms_(45.66%)_Space_42_MB_(88.96%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java b/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java index cf1a9f0..0d5cdf3 100644 --- a/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java +++ b/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #String #Hash_Table #Sliding_Window // #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12 // #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1) +// #2022_07_16_Time_6_ms_(99.03%)_Space_47.9_MB_(50.50%) import java.util.ArrayList; import java.util.List; diff --git a/src/main/java/g0401_0500/s0494_target_sum/Solution.java b/src/main/java/g0401_0500/s0494_target_sum/Solution.java index 73216bf..bcda7ef 100644 --- a/src/main/java/g0401_0500/s0494_target_sum/Solution.java +++ b/src/main/java/g0401_0500/s0494_target_sum/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking // #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +// #2022_07_21_Time_9_ms_(79.99%)_Space_45.2_MB_(32.79%) public class Solution { public int findTargetSumWays(int[] nums, int s) { diff --git a/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java b/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java index c6f24f4..670040d 100644 --- a/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java +++ b/src/main/java/g0501_0600/s0543_diameter_of_binary_tree/Solution.java @@ -2,6 +2,7 @@ // #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree // #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +// #2022_08_02_Time_1_ms_(65.86%)_Space_43.5_MB_(33.52%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java b/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java index fa59d83..050e690 100644 --- a/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java +++ b/src/main/java/g0501_0600/s0560_subarray_sum_equals_k/Solution.java @@ -1,7 +1,7 @@ package g0501_0600.s0560_subarray_sum_equals_k; // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_08_03_Time_21_ms_(98.97%)_Space_46.8_MB_(88.27%) import java.util.HashMap; import java.util.Map; diff --git a/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java b/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java index 6906df4..cd00af5 100644 --- a/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java +++ b/src/main/java/g0601_0700/s0647_palindromic_substrings/Solution.java @@ -1,6 +1,7 @@ package g0601_0700.s0647_palindromic_substrings; // #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +// #2022_03_21_Time_2_ms_(98.77%)_Space_41.7_MB_(75.10%) public class Solution { private void expand(char[] a, int l, int r, int[] res) { diff --git a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java index 7c45162..e272286 100644 --- a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java +++ b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java @@ -1,7 +1,7 @@ package g0701_0800.s0739_daily_temperatures; // #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_03_25_Time_10_ms_(94.99%)_Space_118.3_MB_(70.21%) @SuppressWarnings("java:S135") public class Solution { diff --git a/src/main/java/g0701_0800/s0763_partition_labels/Solution.java b/src/main/java/g0701_0800/s0763_partition_labels/Solution.java index 5799917..26442e9 100644 --- a/src/main/java/g0701_0800/s0763_partition_labels/Solution.java +++ b/src/main/java/g0701_0800/s0763_partition_labels/Solution.java @@ -2,6 +2,7 @@ // #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers // #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1) +// #2022_03_26_Time_1_ms_(100.00%)_Space_40.3_MB_(98.19%) import java.util.ArrayList; import java.util.List; diff --git a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java index d28a8a3..5a48ae3 100644 --- a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java +++ b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java @@ -3,6 +3,7 @@ // #Medium #Top_100_Liked_Questions #String #Dynamic_Programming // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) +// #2023_06_01_Time_33_ms_(46.23%)_Space_48.2_MB_(90.63%) public class Solution { public int longestCommonSubsequence(String text1, String text2) { diff --git a/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt index 84b3839..beeada7 100644 --- a/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0001_two_sum // #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) +// #2023_07_03_Time_202_ms_(91.18%)_Space_38.1_MB_(76.07%) class Solution { fun twoSum(numbers: IntArray, target: Int): IntArray { diff --git a/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt b/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt index 38b6727..855e71f 100644 --- a/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0002_add_two_numbers // #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)) #2023_07_03_Time_203_ms_(96.13%)_Space_41_MB_(77.03%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt b/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt index b893783..ba67840 100644 --- a/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0003_longest_substring_without_repeating_characters // #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) #2023_07_03_Time_201_ms_(87.28%)_Space_38.3_MB_(60.85%) class Solution { fun lengthOfLongestSubstring(s: String): Int { diff --git a/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt b/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt index 1b84313..7cb6f2f 100644 --- a/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt @@ -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) #2023_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%) class Solution { fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double { diff --git a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt index d1c09b5..9c47dfc 100644 --- a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0005_longest_palindromic_substring // #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) +// #2023_07_03_Time_162_ms_(99.00%)_Space_36.6_MB_(79.10%) class Solution { fun longestPalindrome(s: String): String { diff --git a/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt b/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt index d233920..ffc017e 100644 --- a/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0010_regular_expression_matching/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0010_regular_expression_matching // #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) +// #2023_07_03_Time_171_ms_(85.26%)_Space_34.6_MB_(94.74%) class Solution { fun isMatch(s: String, p: String): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt index 197824a..f0e43d4 100644 --- a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0011_container_with_most_water // #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_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%) class Solution { fun maxArea(height: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt b/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt index 87ded3f..0636a70 100644 --- a/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0015_3sum/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0015_3sum // #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_07_03_Time_493_ms_(93.45%)_Space_53_MB_(93.97%) class Solution { fun threeSum(nums: IntArray): List> { diff --git a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt index c3fb180..6b03ea3 100644 --- a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0017_letter_combinations_of_a_phone_number // #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_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%) class Solution { fun letterCombinations(digits: String): List { diff --git a/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt b/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt index 1ec40f7..704c5e4 100644 --- a/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0019_remove_nth_node_from_end_of_list // #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_07_03_Time_144_ms_(96.28%)_Space_34.5_MB_(76.50%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt b/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt index b3f1640..27463b1 100644 --- a/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0020_valid_parentheses/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0020_valid_parentheses // #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_07_03_Time_137_ms_(88.76%)_Space_33.7_MB_(90.45%) class Solution { fun isValid(s: String): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt b/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt index f0cf890..5b3fbac 100644 --- a/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0021_merge_two_sorted_lists // #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_07_03_Time_157_ms_(92.24%)_Space_35.7_MB_(68.58%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt b/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt index de3e599..3938522 100644 --- a/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0022_generate_parentheses/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0022_generate_parentheses // #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_07_03_Time_161_ms_(85.45%)_Space_37.3_MB_(66.18%) class Solution { fun generateParenthesis(n: Int): List { diff --git a/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt b/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt index 3ea7d44..caf5dcf 100644 --- a/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0023_merge_k_sorted_lists // #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_07_03_Time_198_ms_(93.77%)_Space_37.6_MB_(97.03%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt b/src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt index 6332786..b69c90e 100644 --- a/src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0024_swap_nodes_in_pairs // #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_07_03_Time_149_ms_(44.20%)_Space_33.5_MB_(98.90%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt b/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt index d15693c..705aba4 100644 --- a/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0025_reverse_nodes_in_k_group // #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_07_03_Time_189_ms_(67.03%)_Space_36.7_MB_(71.43%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0031_next_permutation/Solution.kt b/src/main/kotlin/g0001_0100/s0031_next_permutation/Solution.kt index b360047..b5e4724 100644 --- a/src/main/kotlin/g0001_0100/s0031_next_permutation/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0031_next_permutation/Solution.kt @@ -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_07_05_Time_205_ms_(48.21%)_Space_36.6_MB_(87.50%) class Solution { fun nextPermutation(nums: IntArray) { diff --git a/src/main/kotlin/g0001_0100/s0032_longest_valid_parentheses/Solution.kt b/src/main/kotlin/g0001_0100/s0032_longest_valid_parentheses/Solution.kt index 458e272..acab96e 100644 --- a/src/main/kotlin/g0001_0100/s0032_longest_valid_parentheses/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0032_longest_valid_parentheses/Solution.kt @@ -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_07_05_Time_161_ms_(82.14%)_Space_36.3_MB_(91.07%) class Solution { fun longestValidParentheses(s: String): Int { diff --git a/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt b/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt index bdcbd32..3b3e68a 100644 --- a/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0033_search_in_rotated_sorted_array // #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_07_05_Time_151_ms_(93.77%)_Space_34.5_MB_(94.08%) class Solution { fun search(nums: IntArray, target: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt b/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt index b91c3a8..802b966 100644 --- a/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array // #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_07_05_Time_174_ms_(100.00%)_Space_37.8_MB_(71.70%) class Solution constructor() { fun searchRange(nums: IntArray, target: Int): IntArray { diff --git a/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt b/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt index 80ec8ed..933c282 100644 --- a/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0035_search_insert_position/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0035_search_insert_position // #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_07_05_Time_159_ms_(93.03%)_Space_36.7_MB_(95.90%) class Solution { fun searchInsert(nums: IntArray, target: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt index 51345df..473d052 100644 --- a/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0039_combination_sum/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0039_combination_sum // #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_07_05_Time_226_ms_(88.89%)_Space_38.1_MB_(94.95%) class Solution { fun combinationSum(candidates: IntArray, target: Int): List> { diff --git a/src/main/kotlin/g0001_0100/s0041_first_missing_positive/Solution.kt b/src/main/kotlin/g0001_0100/s0041_first_missing_positive/Solution.kt index 7b8597c..8ba6324 100644 --- a/src/main/kotlin/g0001_0100/s0041_first_missing_positive/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0041_first_missing_positive/Solution.kt @@ -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_07_05_Time_357_ms_(97.17%)_Space_50.7_MB_(90.57%) class Solution { fun firstMissingPositive(nums: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt b/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt index 91994b3..4638df9 100644 --- a/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0042_trapping_rain_water/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0042_trapping_rain_water // #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_07_05_Time_189_ms_(99.37%)_Space_39.4_MB_(81.90%) class Solution { fun trap(height: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt b/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt index 09a9fa8..d43848e 100644 --- a/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0045_jump_game_ii/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0045_jump_game_ii // #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_07_05_Time_208_ms_(93.37%)_Space_38.2_MB_(94.48%) class Solution { fun jump(nums: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt b/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt index 7bf4e0d..77eb484 100644 --- a/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0046_permutations/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0046_permutations // #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_07_05_Time_188_ms_(99.00%)_Space_37.4_MB_(88.94%) class Solution { fun permute(nums: IntArray): List> { diff --git a/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt b/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt index dfa6676..a6b742f 100644 --- a/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0048_rotate_image/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0048_rotate_image // #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_07_05_Time_160_ms_(90.11%)_Space_35_MB_(84.07%) class Solution { fun rotate(matrix: Array) { diff --git a/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt b/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt index b297365..dbd1150 100644 --- a/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0049_group_anagrams/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0049_group_anagrams // #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_07_05_Time_308_ms_(96.34%)_Space_43.3_MB_(81.41%) class Solution { fun groupAnagrams(strs: Array): List> { diff --git a/src/main/kotlin/g0001_0100/s0051_n_queens/Solution.kt b/src/main/kotlin/g0001_0100/s0051_n_queens/Solution.kt index 8c65d61..fe0e69e 100644 --- a/src/main/kotlin/g0001_0100/s0051_n_queens/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0051_n_queens/Solution.kt @@ -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_07_10_Time_192_ms_(90.74%)_Space_37.8_MB_(88.89%) class Solution { fun solveNQueens(n: Int): List> { diff --git a/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt b/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt index bd1dfa9..394df1d 100644 --- a/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0053_maximum_subarray/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0053_maximum_subarray // #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_07_10_Time_510_ms_(78.81%)_Space_54.7_MB_(69.00%) class Solution { fun maxSubArray(nums: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt b/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt index 3b9686b..07358d4 100644 --- a/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0055_jump_game/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0055_jump_game // #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_07_10_Time_332_ms_(89.35%)_Space_39_MB_(96.44%) class Solution { fun canJump(nums: IntArray): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt b/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt index 3f89aff..5fffab2 100644 --- a/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0056_merge_intervals/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0056_merge_intervals // #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_07_10_Time_334_ms_(80.67%)_Space_43.7_MB_(78.81%) class Solution { fun merge(intervals: Array): Array { diff --git a/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt b/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt index 7ac93d0..0a1951c 100644 --- a/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0062_unique_paths // #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_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%) class Solution { fun uniquePaths(m: Int, n: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt index 6dc4a04..afd3409 100644 --- a/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0064_minimum_path_sum/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0064_minimum_path_sum // #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_07_10_Time_164_ms_(100.00%)_Space_37.3_MB_(84.71%) class Solution { fun minPathSum(grid: Array): Int { diff --git a/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt b/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt index bde4211..d59b39f 100644 --- a/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0070_climbing_stairs/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0070_climbing_stairs // #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_07_10_Time_124_ms_(71.98%)_Space_33.2_MB_(48.60%) class Solution { fun climbStairs(n: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt index a2c3961..6e3f25b 100644 --- a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0072_edit_distance // #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_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%) class Solution { fun minDistance(word1: String, word2: String): Int { diff --git a/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt b/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt index 54cfa2d..b1555da 100644 --- a/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0073_set_matrix_zeroes // #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_07_10_Time_248_ms_(97.33%)_Space_41.6_MB_(79.87%) class Solution { // Approach: Use first row and first column for storing whether in future diff --git a/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt b/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt index 614d82d..b1a79d8 100644 --- a/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0074_search_a_2d_matrix // #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_07_10_Time_159_ms_(74.46%)_Space_35.1_MB_(74.89%) class Solution { fun searchMatrix(matrix: Array, target: Int): Boolean { diff --git a/src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt b/src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt index 4fc7c7a..6b465cf 100644 --- a/src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0075_sort_colors/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0075_sort_colors // #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_07_10_Time_164_ms_(64.43%)_Space_34.4_MB_(84.54%) class Solution { fun sortColors(nums: IntArray) { diff --git a/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt b/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt index b946236..1610599 100644 --- a/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0076_minimum_window_substring/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0076_minimum_window_substring // #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_07_10_Time_191_ms_(96.38%)_Space_37.2_MB_(93.33%) class Solution { fun minWindow(s: String, t: String): String { diff --git a/src/main/kotlin/g0001_0100/s0078_subsets/Solution.kt b/src/main/kotlin/g0001_0100/s0078_subsets/Solution.kt index a966f38..6205c8f 100644 --- a/src/main/kotlin/g0001_0100/s0078_subsets/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0078_subsets/Solution.kt @@ -2,7 +2,7 @@ package g0001_0100.s0078_subsets // #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_07_10_Time_171_ms_(94.92%)_Space_35.8_MB_(96.09%) class Solution { fun subsets(nums: IntArray): List> { diff --git a/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt b/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt index 2b901d2..308aceb 100644 --- a/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0079_word_search/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0079_word_search // #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_07_10_Time_392_ms_(72.92%)_Space_34.7_MB_(83.33%) class Solution { private fun backtrace( diff --git a/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt b/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt index 957fb5c..c3cbcbf 100644 --- a/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.kt @@ -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) #2023_07_10_Time_476_ms_(90.79%)_Space_51.8_MB_(84.21%) import kotlin.math.max diff --git a/src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt b/src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt index dcd2dde..e25001e 100644 --- a/src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0094_binary_tree_inorder_traversal // #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_07_10_Time_152_ms_(66.67%)_Space_35.3_MB_(28.86%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt b/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt index a04a383..8b2b447 100644 --- a/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees/Solution.kt @@ -2,6 +2,7 @@ package g0001_0100.s0096_unique_binary_search_trees // #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) +// #2023_07_10_Time_116_ms_(92.31%)_Space_32.6_MB_(84.62%) class Solution { fun numTrees(n: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt b/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt index e41ce48..4c46a1d 100644 --- a/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree/Solution.kt @@ -3,6 +3,7 @@ package g0001_0100.s0098_validate_binary_search_tree // #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)) +// #2023_07_10_Time_190_ms_(61.62%)_Space_37.6_MB_(48.48%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt index c995a82..5995a83 100644 --- a/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0101_symmetric_tree/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0101_symmetric_tree // #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)) #2023_07_11_Time_153_ms_(82.35%)_Space_34.2_MB_(88.24%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt index a1bfe42..719c71d 100644 --- a/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0102_binary_tree_level_order_traversal // #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) +// #Big_O_Time_O(N)_Space_O(N) #2023_07_11_Time_198_ms_(95.14%)_Space_37_MB_(88.26%) import com_github_leetcode.TreeNode import java.util.ArrayList diff --git a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt index 7bd1d07..6c7ae5a 100644 --- a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt @@ -3,7 +3,7 @@ package g0101_0200.s0104_maximum_depth_of_binary_tree // #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) +// #Big_O_Time_O(N)_Space_O(H) #2023_07_11_Time_166_ms_(83.53%)_Space_36.5_MB_(86.11%) import com_github_leetcode.TreeNode import kotlin.math.max diff --git a/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt b/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt index a45201b..9948f12 100644 --- a/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_travers // #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) +// #2023_07_11_Time_183_ms_(95.45%)_Space_36.9_MB_(82.73%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt b/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt index cee1e53..936b0cc 100644 --- a/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0114_flatten_binary_tree_to_linked_list // #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_09_27_Time_191_ms_(93.10%)_Space_35_MB_(97.70%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt b/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt index 6160220..5c41d64 100644 --- a/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0121_best_time_to_buy_and_sell_stock // #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) +// #Big_O_Time_O(N)_Space_O(1) #2022_09_03_Time_609_ms_(94.06%)_Space_57.3_MB_(94.43%) class Solution { fun maxProfit(prices: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt b/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt index a33e9a5..cce3eaf 100644 --- a/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0124_binary_tree_maximum_path_sum // #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_09_03_Time_331_ms_(74.42%)_Space_45.1_MB_(59.88%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt b/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt index 77929e6..6d9a4ed 100644 --- a/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence/Solution.kt @@ -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) +// #Big_O_Time_O(N_log_N)_Space_O(1) #2022_09_03_Time_460_ms_(97.77%)_Space_51_MB_(99.32%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g0101_0200/s0131_palindrome_partitioning/Solution.kt b/src/main/kotlin/g0101_0200/s0131_palindrome_partitioning/Solution.kt index ef9420b..9b928d3 100644 --- a/src/main/kotlin/g0101_0200/s0131_palindrome_partitioning/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0131_palindrome_partitioning/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0131_palindrome_partitioning // #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_09_03_Time_820_ms_(87.27%)_Space_59.5_MB_(90.91%) @Suppress("NAME_SHADOWING") class Solution { diff --git a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt index 40a3915..44572c2 100644 --- a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0136_single_number // #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) +// #Big_O_Time_O(N)_Space_O(1) #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%) class Solution { fun singleNumber(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt b/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt index 6289f23..2723858 100644 --- a/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0138_copy_list_with_random_pointer // #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_09_03_Time_274_ms_(80.58%)_Space_40.5_MB_(58.99%) import com_github_leetcode.random.Node diff --git a/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt b/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt index 271be6e..8de5c96 100644 --- a/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt @@ -3,6 +3,7 @@ package g0101_0200.s0139_word_break // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming // #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) +// #2022_09_03_Time_197_ms_(87.17%)_Space_34.4_MB_(99.25%) import java.util.HashSet diff --git a/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt b/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt index cf3b6e7..809cd6c 100644 --- a/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0141_linked_list_cycle // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) +// #2022_09_18_Time_223_ms_(91.85%)_Space_38.2_MB_(87.85%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt b/src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt index 17bfba4..76251c2 100644 --- a/src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0142_linked_list_cycle_ii // #Medium #Top_100_Liked_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_II_Day_10_Linked_List #Level_1_Day_4_Linked_List #Udemy_Linked_List -// #Big_O_Time_O(N)_Space_O(1) +// #Big_O_Time_O(N)_Space_O(1) #2022_09_03_Time_192_ms_(63.39%)_Space_35.2_MB_(80.95%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt b/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt index dd0b333..e1ed071 100644 --- a/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt +++ b/src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt @@ -2,6 +2,7 @@ package g0101_0200.s0146_lru_cache // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List // #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) +// #2022_09_03_Time_1116_ms_(97.93%)_Space_139.6_MB_(97.51%) class LRUCache(capacity: Int) { private val nodeMap = HashMap() diff --git a/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt b/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt index 301443c..3cd57aa 100644 --- a/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0148_sort_list // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List // #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) +// #2022_09_06_Time_820_ms_(61.70%)_Space_76_MB_(28.72%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0101_0200/s0152_maximum_product_subarray/Solution.kt b/src/main/kotlin/g0101_0200/s0152_maximum_product_subarray/Solution.kt index 45ce552..eab3561 100644 --- a/src/main/kotlin/g0101_0200/s0152_maximum_product_subarray/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0152_maximum_product_subarray/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0152_maximum_product_subarray // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Dynamic_Programming_I_Day_6 #Level_2_Day_13_Dynamic_Programming #Udemy_Dynamic_Programming -// #Big_O_Time_O(N)_Space_O(1) +// #Big_O_Time_O(N)_Space_O(1) #2022_09_06_Time_253_ms_(88.42%)_Space_42.1_MB_(44.74%) class Solution { fun maxProduct(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt b/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt index fd3c5f0..8c9df2a 100644 --- a/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0153_find_minimum_in_rotated_sorted_array // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search // #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) +// #2022_09_06_Time_262_ms_(60.96%)_Space_35.4_MB_(86.45%) class Solution { private fun findMinUtil(nums: IntArray, l: Int, r: Int): Int { diff --git a/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt b/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt index 78f003b..a5e0e6d 100644 --- a/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt +++ b/src/main/kotlin/g0101_0200/s0155_min_stack/MinStack.kt @@ -3,6 +3,7 @@ package g0101_0200.s0155_min_stack // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design // #Udemy_Design #Big_O_Time_O(1)_Space_O(N) +// #2022_09_06_Time_331_ms_(84.88%)_Space_54.3_MB_(46.34%) class MinStack() { private val stack: ArrayDeque> = ArrayDeque() diff --git a/src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt b/src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt index 4871700..4818424 100644 --- a/src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0160_intersection_of_two_linked_lists // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_II_Day_11_Linked_List #Udemy_Linked_List #Big_O_Time_O(M+N)_Space_O(1) +// #2022_09_08_Time_262_ms_(83.50%)_Space_54.7_MB_(75.26%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt b/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt index f34ed84..b709588 100644 --- a/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0169_majority_element/Solution.kt @@ -2,7 +2,7 @@ package g0101_0200.s0169_majority_element // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) +// #Big_O_Time_O(n)_Space_O(1) #2022_09_08_Time_460_ms_(51.25%)_Space_52.9_MB_(52.64%) class Solution { fun majorityElement(arr: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt b/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt index 9970fef..363bdbf 100644 --- a/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0189_rotate_array/Solution.kt @@ -2,6 +2,7 @@ package g0101_0200.s0189_rotate_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers // #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) +// #2022_09_08_Time_483_ms_(86.95%)_Space_71.9_MB_(50.13%) @Suppress("NAME_SHADOWING") class Solution { diff --git a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt index e095e29..aba54d7 100644 --- a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt @@ -3,6 +3,7 @@ package g0101_0200.s0198_house_robber // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 // #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) +// #2022_09_08_Time_156_ms_(92.24%)_Space_34.1_MB_(61.64%) class Solution { fun rob(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt b/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt index 1498e48..e2ae2b0 100644 --- a/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0200_number_of_islands/Solution.kt @@ -4,7 +4,7 @@ package g0101_0200.s0200_number_of_islands // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) +// #Big_O_Time_O(M*N)_Space_O(M*N) #2022_09_09_Time_252_ms_(95.41%)_Space_52.4_MB_(86.52%) class Solution { fun numIslands(grid: Array): Int { diff --git a/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt b/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt index 6d1c635..c4135e6 100644 --- a/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt @@ -3,6 +3,7 @@ package g0201_0300.s0206_reverse_linked_list // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking // #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) +// #2022_09_27_Time_279_ms_(45.78%)_Space_36.2_MB_(49.40%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt b/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt index fb85d5e..ac7754f 100644 --- a/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0207_course_schedule/Solution.kt @@ -2,6 +2,7 @@ package g0201_0300.s0207_course_schedule // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search // #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) +// #2024_01_16_Time_183_ms_(92.07%)_Space_39.1_MB_(81.50%) class Solution { fun canFinish(numCourses: Int, prerequisites: Array): Boolean { diff --git a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt index 6e2648b..a23701f 100644 --- a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt +++ b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt @@ -3,6 +3,7 @@ package g0201_0300.s0208_implement_trie_prefix_tree // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie // #Level_2_Day_16_Design #Udemy_Trie_and_Heap // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) +// #2022_09_10_Time_689_ms_(61.00%)_Space_87.9_MB_(36.00%) class Trie { private val root: TrieNode diff --git a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt index 4fe2885..7544804 100644 --- a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt @@ -2,7 +2,7 @@ package g0201_0300.s0215_kth_largest_element_in_an_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue // #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Big_O_Time_O(n*log(n))_Space_O(log(n)) +// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2022_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%) class Solution { fun findKthLargest(nums: IntArray, k: Int): Int { diff --git a/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt b/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt index 88f9da3..651c7cc 100644 --- a/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0221_maximal_square/Solution.kt @@ -2,6 +2,7 @@ package g0201_0300.s0221_maximal_square // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix // #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n) +// #2022_09_10_Time_614_ms_(44.00%)_Space_76.2_MB_(65.33%) class Solution { fun maximalSquare(matrix: Array): Int { diff --git a/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt index f930d0f..0bb6e83 100644 --- a/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0226_invert_binary_tree/Solution.kt @@ -2,7 +2,7 @@ package g0201_0300.s0226_invert_binary_tree // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_09_27_Time_233_ms_(54.90%)_Space_34.5_MB_(11.33%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt b/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt index f9a72e8..a74cda3 100644 --- a/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.kt @@ -2,7 +2,7 @@ package g0201_0300.s0230_kth_smallest_element_in_a_bst // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_09_10_Time_393_ms_(33.33%)_Space_41.8_MB_(66.67%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt b/src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt index 42326e1..dd23462 100644 --- a/src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt @@ -2,6 +2,7 @@ package g0201_0300.s0234_palindrome_linked_list // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List // #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) +// #2022_09_18_Time_641_ms_(79.53%)_Space_80.9_MB_(58.23%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt index 4ee4db4..1450ae9 100644 --- a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt @@ -2,6 +2,7 @@ package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +// #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt index 5383015..d66598c 100644 --- a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt @@ -2,6 +2,7 @@ package g0201_0300.s0238_product_of_array_except_self // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum // #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n) +// #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%) class Solution { fun productExceptSelf(nums: IntArray): IntArray { diff --git a/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt b/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt index 5322a58..710b73f 100644 --- a/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0239_sliding_window_maximum/Solution.kt @@ -2,6 +2,7 @@ package g0201_0300.s0239_sliding_window_maximum // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue // #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k) +// #2022_09_10_Time_1059_ms_(86.14%)_Space_113.7_MB_(65.35%) import java.util.LinkedList diff --git a/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt b/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt index 75a313e..8c429d7 100644 --- a/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.kt @@ -2,7 +2,7 @@ package g0201_0300.s0240_search_a_2d_matrix_ii // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Matrix // #Divide_and_Conquer #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 -// #Big_O_Time_O(n+m)_Space_O(1) +// #Big_O_Time_O(n+m)_Space_O(1) #2022_09_10_Time_460_ms_(66.08%)_Space_55.9_MB_(65.19%) class Solution { fun searchMatrix(matrix: Array, target: Int): Boolean { diff --git a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt index d3d1af6..cfd9502 100644 --- a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt @@ -2,7 +2,7 @@ package g0201_0300.s0283_move_zeroes // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers // #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays -// #Big_O_Time_O(n)_Space_O(1) +// #Big_O_Time_O(n)_Space_O(1) #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%) class Solution { fun moveZeroes(nums: IntArray) { diff --git a/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt b/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt index 1631fa1..847624f 100644 --- a/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number/Solution.kt @@ -2,6 +2,7 @@ package g0201_0300.s0287_find_the_duplicate_number // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers // #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) +// #2022_09_10_Time_656_ms_(66.21%)_Space_78.6_MB_(66.89%) class Solution { fun findDuplicate(nums: IntArray): Int { diff --git a/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt b/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt index 012c302..fe1c1ef 100644 --- a/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt +++ b/src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.kt @@ -2,6 +2,7 @@ package g0201_0300.s0295_find_median_from_data_stream // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design // #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n) +// #2022_09_11_Time_2289_ms_(33.60%)_Space_153.3_MB_(5.74%) import java.util.PriorityQueue diff --git a/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt b/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt index 8e36315..76223db 100644 --- a/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence/Solution.kt @@ -3,6 +3,7 @@ package g0201_0300.s0300_longest_increasing_subsequence // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 // #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +// #2022_09_11_Time_318_ms_(82.28%)_Space_39.2_MB_(82.77%) class Solution { fun lengthOfLIS(nums: IntArray): Int { diff --git a/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt b/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt index e24b2c2..d6d08c8 100644 --- a/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0322_coin_change/Solution.kt @@ -3,6 +3,7 @@ package g0301_0400.s0322_coin_change // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 // #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +// #2022_09_11_Time_332_ms_(50.68%)_Space_37.6_MB_(79.93%) class Solution { fun coinChange(coins: IntArray, amount: Int): Int { diff --git a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt index 9aff105..7d56712 100644 --- a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt @@ -1,7 +1,7 @@ package g0301_0400.s0338_counting_bits // #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) +// #Big_O_Time_O(num)_Space_O(num) #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%) class Solution { fun countBits(num: Int): IntArray { diff --git a/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt b/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt index 20e9710..998d613 100644 --- a/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements/Solution.kt @@ -3,6 +3,7 @@ package g0301_0400.s0347_top_k_frequent_elements // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting // #Heap_Priority_Queue #Counting #Divide_and_Conquer #Quickselect #Bucket_Sort // #Data_Structure_II_Day_20_Heap_Priority_Queue #Big_O_Time_O(n*log(n))_Space_O(k) +// #2022_09_11_Time_268_ms_(99.74%)_Space_42_MB_(87.93%) import java.util.PriorityQueue import java.util.Queue diff --git a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt index a047f73..eb26cd4 100644 --- a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt @@ -1,7 +1,7 @@ package g0301_0400.s0394_decode_string // #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%) class Solution { private var i = 0 diff --git a/src/main/kotlin/g0401_0500/s0416_partition_equal_subset_sum/Solution.kt b/src/main/kotlin/g0401_0500/s0416_partition_equal_subset_sum/Solution.kt index 84a8f4e..6d841d2 100644 --- a/src/main/kotlin/g0401_0500/s0416_partition_equal_subset_sum/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0416_partition_equal_subset_sum/Solution.kt @@ -1,7 +1,7 @@ package g0401_0500.s0416_partition_equal_subset_sum // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming -// #Big_O_Time_O(n*sums)_Space_O(n*sums) +// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2023_01_02_Time_204_ms_(98.82%)_Space_34.9_MB_(100.00%) class Solution { fun canPartition(nums: IntArray): Boolean { diff --git a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt index 8041a38..a4bdc7c 100644 --- a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt @@ -1,7 +1,7 @@ package g0401_0500.s0437_path_sum_iii // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.kt b/src/main/kotlin/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.kt index 0642ed2..f5d47bc 100644 --- a/src/main/kotlin/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.kt @@ -3,6 +3,7 @@ package g0401_0500.s0438_find_all_anagrams_in_a_string // #Medium #Top_100_Liked_Questions #String #Hash_Table #Sliding_Window // #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12 // #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1) +// #2022_09_11_Time_561_ms_(54.68%)_Space_48.1_MB_(64.53%) class Solution { fun findAnagrams(s: String, p: String): List { diff --git a/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt b/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt index e381a42..159c156 100644 --- a/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0494_target_sum/Solution.kt @@ -2,6 +2,7 @@ package g0401_0500.s0494_target_sum // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking // #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +// #2022_09_16_Time_308_ms_(89.61%)_Space_37.2_MB_(61.04%) @Suppress("NAME_SHADOWING") class Solution { diff --git a/src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree/Solution.kt b/src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree/Solution.kt index 92bbd3d..7bd98b3 100644 --- a/src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree/Solution.kt +++ b/src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree/Solution.kt @@ -2,6 +2,7 @@ package g0501_0600.s0543_diameter_of_binary_tree // #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree // #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +// #2022_09_11_Time_307_ms_(43.93%)_Space_37.1_MB_(67.78%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k/Solution.kt b/src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k/Solution.kt index acdf797..dafffb8 100644 --- a/src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k/Solution.kt +++ b/src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k/Solution.kt @@ -1,7 +1,7 @@ package g0501_0600.s0560_subarray_sum_equals_k // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_09_11_Time_692_ms_(53.27%)_Space_70.5_MB_(24.30%) class Solution { fun subarraySum(nums: IntArray, k: Int): Int { diff --git a/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt b/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt index 9d8d4e0..85e60b8 100644 --- a/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt +++ b/src/main/kotlin/g0601_0700/s0647_palindromic_substrings/Solution.kt @@ -1,6 +1,7 @@ package g0601_0700.s0647_palindromic_substrings // #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +// #2022_09_11_Time_266_ms_(67.83%)_Space_34_MB_(93.91%) class Solution { private fun expand(a: CharArray, l: Int, r: Int, res: IntArray) { diff --git a/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt b/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt index ceac072..89b9104 100644 --- a/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt @@ -1,7 +1,7 @@ package g0701_0800.s0739_daily_temperatures // #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) +// #Big_O_Time_O(n)_Space_O(n) #2022_09_13_Time_936_ms_(80.54%)_Space_79.5_MB_(63.09%) class Solution { fun dailyTemperatures(temperatures: IntArray): IntArray { diff --git a/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt b/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt index 52a1203..02137f7 100644 --- a/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt @@ -2,6 +2,7 @@ package g0701_0800.s0763_partition_labels // #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers // #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1) +// #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%) class Solution { fun partitionLabels(s: String): List { diff --git a/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt b/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt index 9318086..d55d729 100644 --- a/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt +++ b/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt @@ -3,6 +3,7 @@ package g1101_1200.s1143_longest_common_subsequence // #Medium #Top_100_Liked_Questions #String #Dynamic_Programming // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) +// #2022_09_13_Time_307_ms_(38.36%)_Space_38.7_MB_(86.99%) class Solution { fun longestCommonSubsequence(text1: String, text2: String): Int {