Skip to content

Updated tasks 1-21 #1855

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Nov 9, 2024
Merged

Updated tasks 1-21 #1855

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 18 additions & 18 deletions README.md
View file
Open in desktop

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0001_two_sum/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +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)
// #AI_can_be_used_to_solve_the_task #2024_01_04_Time_2_ms_(85.97%)_Space_44.8_MB_(15.45%)
// #AI_can_be_used_to_solve_the_task #2024_11_09_Time_2_ms_(98.90%)_Space_44.9_MB_(47.05%)

import java.util.HashMap;
import java.util.Map;
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0002_add_two_numbers/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,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)) #AI_can_be_used_to_solve_the_task
// #2024_01_04_Time_1_ms_(100.00%)_Space_44.4_MB_(16.63%)
// #2024_11_09_Time_1_ms_(100.00%)_Space_43.7_MB_(99.52%)

import com_github_leetcode.ListNode;

Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,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) #AI_can_be_used_to_solve_the_task
// #2024_01_04_Time_2_ms_(99.52%)_Space_43.6_MB_(75.37%)
// #2024_11_09_Time_2_ms_(98.59%)_Space_43.4_MB_(90.39%)

public class Solution {
public int lengthOfLongestSubstring(String s) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #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) #AI_can_be_used_to_solve_the_task
// #2024_01_04_Time_1_ms_(100.00%)_Space_46.5_MB_(7.80%)
// #2024_11_09_Time_1_ms_(100.00%)_Space_46.1_MB_(40.80%)

@SuppressWarnings("java:S2234")
public class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0005_longest_palindromic_substring/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +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%)
// #2024_11_09_Time_7_ms_(97.82%)_Space_43_MB_(66.41%)

public class Solution {
public String longestPalindrome(String s) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0007_reverse_integer/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0001_0100.s0007_reverse_integer;

// #Medium #Top_Interview_Questions #Math #Udemy_Integers
// #2024_01_04_Time_1_ms_(96.61%)_Space_40.9_MB_(11.62%)
// #2024_11_09_Time_0_ms_(100.00%)_Space_40.9_MB_(36.21%)

public class Solution {
public int reverse(int x) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0001_0100.s0008_string_to_integer_atoi;

// #Medium #Top_Interview_Questions #String #2024_01_04_Time_1_ms_(100.00%)_Space_42.7_MB_(8.86%)
// #Medium #Top_Interview_Questions #String #2024_11_09_Time_1_ms_(100.00%)_Space_42_MB_(95.40%)

public class Solution {
public int myAtoi(String str) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0009_palindrome_number/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0001_0100.s0009_palindrome_number;

// #Easy #Math #Udemy_Integers #2024_01_04_Time_5_ms_(77.91%)_Space_44.1_MB_(13.06%)
// #Easy #Math #Udemy_Integers #2024_11_09_Time_4_ms_(100.00%)_Space_44.1_MB_(28.20%)

public class Solution {
public boolean isPalindrome(int x) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0010_regular_expression_matching/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0001_0100.s0010_regular_expression_matching;

// #Hard #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%)
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_11_09_Time_1_ms_(100.00%)_Space_41.8_MB_(87.69%)

public class Solution {
private Boolean[][] cache;
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +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)
// #2024_02_11_Time_3_ms_(95.71%)_Space_58.1_MB_(33.16%)
// #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%)

public class Solution {
public int maxArea(int[] height) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0015_3sum/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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) #2024_02_11_Time_29_ms_(82.24%)_Space_52.7_MB_(15.37%)
// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_11_09_Time_29_ms_(72.02%)_Space_52_MB_(33.13%)

import java.util.ArrayList;
import java.util.Arrays;
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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) #2024_02_11_Time_0_ms_(100.00%)_Space_41.8_MB_(71.86%)
// #Big_O_Time_O(4^n)_Space_O(n) #2024_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%)

import java.util.ArrayList;
import java.util.Collections;
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +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)
// #2024_02_11_Time_0_ms_(100.00%)_Space_41.7_MB_(44.22%)
// #2024_11_09_Time_0_ms_(100.00%)_Space_41.4_MB_(87.28%)

import com_github_leetcode.ListNode;

Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0020_valid_parentheses/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +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)
// #2024_02_11_Time_1_ms_(98.78%)_Space_41.6_MB_(32.59%)
// #2024_11_09_Time_2_ms_(97.19%)_Space_41.8_MB_(17.32%)

import java.util.Stack;

Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +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%)
// #2024_11_09_Time_0_ms_(100.00%)_Space_43_MB_(5.04%)

import com_github_leetcode.ListNode;

Expand Down
Loading