Skip to content

Commit a2c1be8

Browse files
javadevjavadev
committed
Version 1.8
1 parent eeaa80a commit a2c1be8

File tree

239 files changed

+715
-668
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

239 files changed

+715
-668
lines changed

Diff for: ‎pom.xml

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@
55
<groupId>com.github.javadev</groupId>
66
<artifactId>leetcode-in-all</artifactId>
77
<packaging>jar</packaging>
8-
<version>1.7</version>
8+
<version>1.8</version>
99
<name>leetcode-in-all</name>
1010
<description>104 LeetCode algorithm problem solutions</description>
1111
<url>https://github.com/javadev/LeetCode-in-All</url>

Diff for: ‎src/main/java/g0001_0100/s0001_two_sum/Solution.java

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,9 @@
11
package g0001_0100.s0001_two_sum;
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
4-
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
5-
// #AI_can_be_used_to_solve_the_task #2024_11_09_Time_2_ms_(98.90%)_Space_44.9_MB_(47.05%)
4+
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap
5+
// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task
6+
// #2024_11_09_Time_2_ms_(98.90%)_Space_44.9_MB_(47.05%)
67

78
import java.util.HashMap;
89
import java.util.Map;

Diff for: ‎src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
44
// #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
5-
// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #AI_can_be_used_to_solve_the_task
6-
// #2024_11_09_Time_1_ms_(100.00%)_Space_43.7_MB_(99.52%)
5+
// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
6+
// #AI_can_be_used_to_solve_the_task #2024_11_09_Time_1_ms_(100.00%)_Space_43.7_MB_(99.52%)
77

88
import com_github_leetcode.ListNode;
99

Diff for: ‎src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
44
// #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings
5-
// #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
5+
// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
66
// #2024_11_09_Time_2_ms_(98.59%)_Space_43.4_MB_(90.39%)
77

88
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0004_median_of_two_sorted_arrays;
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer
4-
// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #AI_can_be_used_to_solve_the_task
5-
// #2024_11_09_Time_1_ms_(100.00%)_Space_46.1_MB_(40.80%)
4+
// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
5+
// #AI_can_be_used_to_solve_the_task #2024_11_09_Time_1_ms_(100.00%)_Space_46.1_MB_(40.80%)
66

77
@SuppressWarnings("java:S2234")
88
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming
5-
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
6-
// #2024_11_09_Time_7_ms_(97.82%)_Space_43_MB_(66.41%)
5+
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
6+
// #Big_O_Time_O(n)_Space_O(n) #2024_11_09_Time_7_ms_(97.82%)_Space_43_MB_(66.41%)
77

88
public class Solution {
99
public String longestPalindrome(String s) {

Diff for: ‎src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0001_0100.s0006_zigzag_conversion;
22

3-
// #Medium #String #2024_11_17_Time_2_ms_(99.71%)_Space_44.5_MB_(94.69%)
3+
// #Medium #String #Top_Interview_150_Array/String
4+
// #2024_11_17_Time_2_ms_(99.71%)_Space_44.5_MB_(94.69%)
45

56
public class Solution {
67
public String convert(String s, int numRows) {

Diff for: ‎src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44

55
public class Solution {
66
public int myAtoi(String str) {
7-
if (str == null || str.length() == 0) {
7+
if (str == null || str.isEmpty()) {
88
return 0;
99
}
1010
int i = 0;

Diff for: ‎src/main/java/g0001_0100/s0009_palindrome_number/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
package g0001_0100.s0009_palindrome_number;
22

3-
// #Easy #Math #Udemy_Integers #2024_11_09_Time_4_ms_(100.00%)_Space_44.1_MB_(28.20%)
3+
// #Easy #Math #Udemy_Integers #Top_Interview_150_Math
4+
// #2024_11_09_Time_4_ms_(100.00%)_Space_44.1_MB_(28.20%)
45

56
public class Solution {
67
public boolean isPalindrome(int x) {

Diff for: ‎src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0011_container_with_most_water;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
4-
// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
4+
// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
55
// #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%)
66

77
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0015_3sum/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
44
// #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers
5-
// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_11_09_Time_29_ms_(72.02%)_Space_52_MB_(33.13%)
5+
// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
6+
// #2024_11_09_Time_29_ms_(72.02%)_Space_52_MB_(33.13%)
67

78
import java.util.ArrayList;
89
import java.util.Arrays;

Diff for: ‎src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
44
// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(4^n)_Space_O(n) #2024_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
6+
// #2024_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%)
67

78
import java.util.ArrayList;
89
import java.util.Collections;

Diff for: ‎src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0019_remove_nth_node_from_end_of_list;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List
4-
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L)
5-
// #2024_11_09_Time_0_ms_(100.00%)_Space_41.4_MB_(87.28%)
4+
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List
5+
// #Big_O_Time_O(L)_Space_O(L) #2024_11_09_Time_0_ms_(100.00%)_Space_41.4_MB_(87.28%)
66

77
import com_github_leetcode.ListNode;
88

Diff for: ‎src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0020_valid_parentheses;
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack
4-
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
5-
// #2024_11_09_Time_2_ms_(97.19%)_Space_41.8_MB_(17.32%)
4+
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
5+
// #Big_O_Time_O(n)_Space_O(n) #2024_11_09_Time_2_ms_(97.19%)_Space_41.8_MB_(17.32%)
66

77
import java.util.Stack;
88

Diff for: ‎src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
44
// #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
5-
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n)
6-
// #2024_11_09_Time_0_ms_(100.00%)_Space_43_MB_(5.04%)
5+
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
6+
// #Big_O_Time_O(m+n)_Space_O(m+n) #2024_11_09_Time_0_ms_(100.00%)_Space_43_MB_(5.04%)
77

88
import com_github_leetcode.ListNode;
99

Diff for: ‎src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n) #2024_11_10_Time_0_ms_(100.00%)_Space_42.8_MB_(84.67%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
6+
// #2024_11_10_Time_0_ms_(100.00%)_Space_42.8_MB_(84.67%)
67

78
import java.util.ArrayList;
89
import java.util.List;

Diff for: ‎src/main/java/g0001_0100/s0023_merge_k_sorted_lists/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0023_merge_k_sorted_lists;
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List
4-
// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k))
5-
// #2024_11_10_Time_1_ms_(99.86%)_Space_44.1_MB_(79.93%)
4+
// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer
5+
// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_11_10_Time_1_ms_(99.86%)_Space_44.1_MB_(79.93%)
66

77
import com_github_leetcode.ListNode;
88

Diff for: ‎src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0025_reverse_nodes_in_k_group;
22

33
// #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List
4-
// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k)
4+
// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k)
55
// #2024_11_10_Time_0_ms_(100.00%)_Space_44.4_MB_(33.90%)
66

77
import com_github_leetcode.ListNode;

Diff for: ‎src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search
5-
// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
5+
// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
66
// #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(21.10%)
77

88
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search
4-
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1)
5-
// #2024_11_10_Time_0_ms_(100.00%)_Space_45.7_MB_(82.78%)
4+
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search
5+
// #Big_O_Time_O(log_n)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_45.7_MB_(82.78%)
66

77
public class Solution {
88
public int[] searchRange(int[] nums, int target) {

Diff for: ‎src/main/java/g0001_0100/s0035_search_insert_position/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0035_search_insert_position;
22

33
// #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search
4-
// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1)
4+
// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
55
// #2024_11_10_Time_0_ms_(100.00%)_Space_43_MB_(40.42%)
66

77
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0039_combination_sum/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
44
// #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_11_10_Time_1_ms_(99.99%)_Space_44.5_MB_(51.73%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
6+
// #2024_11_10_Time_1_ms_(99.99%)_Space_44.5_MB_(51.73%)
67

78
import java.util.ArrayList;
89
import java.util.List;

Diff for: ‎src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers
44
// #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_46.2_MB_(57.86%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2024_11_10_Time_0_ms_(100.00%)_Space_46.2_MB_(57.86%)
67

78
public class Solution {
89
public int trap(int[] height) {

Diff for: ‎src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_45_MB_(64.44%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2024_11_10_Time_0_ms_(100.00%)_Space_45_MB_(64.44%)
67

78
public class Solution {
89
private int getMax(int[] nums, int l, int r) {

Diff for: ‎src/main/java/g0001_0100/s0046_permutations/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
44
// #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
5-
// #Udemy_Backtracking/Recursion #Big_O_Time_O(n*n!)_Space_O(n+n!)
5+
// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!)
66
// #2024_11_10_Time_1_ms_(94.08%)_Space_45.1_MB_(6.84%)
77

88
import java.util.ArrayList;

Diff for: ‎src/main/java/g0001_0100/s0048_rotate_image/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix
44
// #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix
5-
// #Big_O_Time_O(n^2)_Space_O(1) #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(43.71%)
5+
// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
6+
// #2024_11_10_Time_0_ms_(100.00%)_Space_42.2_MB_(43.71%)
67

78
public class Solution {
89
public void rotate(int[][] matrix) {

Diff for: ‎src/main/java/g0001_0100/s0049_group_anagrams/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting
44
// #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings
5-
// #Big_O_Time_O(n*k_log_k)_Space_O(n) #2024_11_11_Time_6_ms_(97.61%)_Space_47.7_MB_(69.56%)
5+
// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
6+
// #2024_11_11_Time_6_ms_(97.61%)_Space_47.7_MB_(69.56%)
67

78
import java.util.ArrayList;
89
import java.util.HashMap;

Diff for: ‎src/main/java/g0001_0100/s0053_maximum_subarray/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
5-
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
5+
// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
66
// #2024_11_11_Time_1_ms_(99.32%)_Space_56.9_MB_(54.82%)
77

88
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0055_jump_game/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_11_11_Time_1_ms_(100.00%)_Space_45.6_MB_(44.48%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2024_11_11_Time_1_ms_(100.00%)_Space_45.6_MB_(44.48%)
67

78
public class Solution {
89
public boolean canJump(int[] nums) {

Diff for: ‎src/main/java/g0001_0100/s0056_merge_intervals/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
44
// #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
5-
// #Big_O_Time_O(n_log_n)_Space_O(n) #2024_11_11_Time_7_ms_(98.37%)_Space_46.8_MB_(11.43%)
5+
// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
6+
// #2024_11_11_Time_7_ms_(98.37%)_Space_46.8_MB_(11.43%)
67

78
import java.util.ArrayList;
89
import java.util.Arrays;

Diff for: ‎src/main/java/g0001_0100/s0064_minimum_path_sum/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0064_minimum_path_sum;
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
4-
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
5-
// #2024_11_11_Time_1_ms_(99.73%)_Space_47.5_MB_(44.29%)
4+
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
5+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_11_11_Time_1_ms_(99.73%)_Space_47.5_MB_(44.29%)
66

77
public class Solution {
88
public int minPathSum(int[][] grid) {

Diff for: ‎src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
44
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
5-
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n)
6-
// #2024_11_11_Time_0_ms_(100.00%)_Space_40.3_MB_(41.06%)
5+
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
6+
// #Big_O_Time_O(n)_Space_O(n) #2024_11_11_Time_0_ms_(100.00%)_Space_40.3_MB_(41.06%)
77

88
public class Solution {
99
public int climbStairs(int n) {

Diff for: ‎src/main/java/g0001_0100/s0072_edit_distance/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
5-
// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
5+
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
66
// #2024_11_11_Time_3_ms_(97.19%)_Space_43.2_MB_(98.23%)
77

88
@SuppressWarnings("java:S2234")

Diff for: ‎src/main/java/g0001_0100/s0073_set_matrix_zeroes/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0073_set_matrix_zeroes;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
4-
// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1)
4+
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1)
55
// #2024_11_11_Time_0_ms_(100.00%)_Space_45.6_MB_(50.86%)
66

77
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search
5-
// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1)
5+
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1)
66
// #2024_11_11_Time_0_ms_(100.00%)_Space_42.2_MB_(40.02%)
77

88
public class Solution {

Diff for: ‎src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0076_minimum_window_substring;
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
4-
// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1)
5-
// #2024_11_11_Time_2_ms_(99.83%)_Space_44.5_MB_(89.46%)
4+
// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window
5+
// #Big_O_Time_O(s.length())_Space_O(1) #2024_11_11_Time_2_ms_(99.83%)_Space_44.5_MB_(89.46%)
66

77
public class Solution {
88
public String minWindow(String s, String t) {

Diff for: ‎src/main/java/g0001_0100/s0079_word_search/Solution.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0001_0100.s0079_word_search;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking
4-
// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n)
5-
// #2024_11_11_Time_64_ms_(98.51%)_Space_41.6_MB_(51.63%)
4+
// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
5+
// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_11_11_Time_64_ms_(98.51%)_Space_41.6_MB_(51.63%)
66

77
public class Solution {
88
private boolean exists = false;

Diff for: ‎src/main/java/g0001_0100/s0098_validate_binary_search_tree/Solution.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
44
// #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree
5-
// #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N))
5+
// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N))
66
// #2024_11_13_Time_0_ms_(100.00%)_Space_42.9_MB_(95.84%)
77

88
import com_github_leetcode.TreeNode;

Diff for: ‎src/main/java/g0101_0200/s0101_symmetric_tree/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
44
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree
5-
// #Big_O_Time_O(N)_Space_O(log(N)) #2024_11_13_Time_0_ms_(100.00%)_Space_41.4_MB_(83.38%)
5+
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
6+
// #2024_11_13_Time_0_ms_(100.00%)_Space_41.4_MB_(83.38%)
67

78
import com_github_leetcode.TreeNode;
89

Diff for: ‎src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.java

+2-1
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree
44
// #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue
5-
// #Big_O_Time_O(N)_Space_O(N) #2024_11_13_Time_1_ms_(91.19%)_Space_45.1_MB_(24.35%)
5+
// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N)
6+
// #2024_11_13_Time_1_ms_(91.19%)_Space_45.1_MB_(24.35%)
67

78
import com_github_leetcode.TreeNode;
89
import java.util.ArrayList;

0 commit comments

Comments
 (0)