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

‎pom.xml

Lines changed: 1 addition & 1 deletion
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>

‎src/main/java/g0001_0100/s0001_two_sum/Solution.java

Lines changed: 3 additions & 2 deletions
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;

‎src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java

Lines changed: 2 additions & 2 deletions
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

‎src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java

Lines changed: 1 addition & 1 deletion
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 {

‎src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java

Lines changed: 2 additions & 2 deletions
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 {

‎src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java

Lines changed: 2 additions & 2 deletions
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) {

‎src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java

Lines changed: 2 additions & 1 deletion
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) {

‎src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java

Lines changed: 1 addition & 1 deletion
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;

‎src/main/java/g0001_0100/s0009_palindrome_number/Solution.java

Lines changed: 2 additions & 1 deletion
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) {

‎src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java

Lines changed: 1 addition & 1 deletion
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 {

0 commit comments

Comments
 (0)