Skip to content

Updated readme and tags #37

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
Apr 8, 2025
Merged

Updated readme and tags #37

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
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
namespace LeetCodeNet.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)
// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap
// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task
// #2023_12_18_Time_134_ms_(81.26%)_Space_44.8_MB_(19.72%)

public class Solution {
Expand All @@ -18,4 +19,3 @@ public int[] TwoSum(int[] numbers, int target) {
}
}
}

3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0002_add_two_numbers/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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)) #2023_12_19_Time_84_ms_(77.30%)_Space_49.4_MB_(51.01%)
// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M))
// #AI_can_be_used_to_solve_the_task #2023_12_19_Time_84_ms_(77.30%)_Space_49.4_MB_(51.01%)

using LeetCodeNet.Com_github_leetcode;

Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0003_longest_substring_without_repeating_chara

// #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) #2023_12_22_Time_50_ms_(98.40%)_Space_41.9_MB_(30.26%)
// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
// #2023_12_22_Time_50_ms_(98.40%)_Space_41.9_MB_(30.26%)

public class Solution {
public int LengthOfLongestSubstring(string s) {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0004_median_of_two_sorted_arrays/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
namespace LeetCodeNet.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) #2023_12_22_Time_83_ms_(96.35%)_Space_54_MB_(6.56%)
// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1)
// #AI_can_be_used_to_solve_the_task #2023_12_22_Time_83_ms_(96.35%)_Space_54_MB_(6.56%)

public class Solution {
public double FindMedianSortedArrays(int[] nums1, int[] nums2) {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,8 @@ namespace LeetCodeNet.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_12_22_Time_61_ms_(99.50%)_Space_40_MB_(56.86%)
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
// #Big_O_Time_O(n)_Space_O(n) #2023_12_22_Time_61_ms_(99.50%)_Space_40_MB_(56.86%)

public class Solution {
public string LongestPalindrome(string s) {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0006_zigzag_conversion/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
namespace LeetCodeNet.G0001_0100.S0006_zigzag_conversion {

// #Medium #String #2023_12_22_Time_59_ms_(99.87%)_Space_45.1_MB_(74.68%)
// #Medium #String #Top_Interview_150_Array/String
// #2023_12_22_Time_59_ms_(99.87%)_Space_45.1_MB_(74.68%)

using System.Text;

Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0009_palindrome_number/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
namespace LeetCodeNet.G0001_0100.S0009_palindrome_number {

// #Easy #Math #Udemy_Integers #2023_12_22_Time_42_ms_(34.61%)_Space_31_MB_(36.04%)
// #Easy #Math #Udemy_Integers #Top_Interview_150_Math
// #2023_12_22_Time_42_ms_(34.61%)_Space_31_MB_(36.04%)

public class Solution {
public bool IsPalindrome(int x) {
Expand Down
5 changes: 2 additions & 3 deletions LeetCodeNet/G0001_0100/S0010_regular_expression_matching/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,7 @@
namespace LeetCodeNet.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_12_22_Time_59_ms_(96.10%)_Space_40.5_MB_(47.63%)
// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_12_22_Time_59_ms_(96.10%)_Space_40.5_MB_(47.63%)

public class Solution {
private bool?[,] cache;
Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
namespace LeetCodeNet.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)
// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
// #2024_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%)

public class Solution {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2023_12_26_Time_173_ms_(75.85%)_Space_74.7_MB_(28.23%)
// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
// #2023_12_26_Time_173_ms_(75.85%)_Space_74.7_MB_(28.23%)

public class Solution {
public IList<IList<int>> ThreeSum(int[] nums) {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2023_12_26_Time_108_ms_(95.24%)_Space_46.3_MB_(5.39%)
// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
// #2023_12_26_Time_108_ms_(95.24%)_Space_46.3_MB_(5.39%)

using System.Text;

Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0019_remove_nth_node_from_end_of_list/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.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_12_26_Time_69_ms_(90.79%)_Space_40_MB_(5.04%)
// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List
// #Big_O_Time_O(L)_Space_O(L) #2023_12_26_Time_69_ms_(90.79%)_Space_40_MB_(5.04%)

using LeetCodeNet.Com_github_leetcode;

Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0020_valid_parentheses/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.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_12_26_Time_53_ms_(96.68%)_Space_39.3_MB_(10.78%)
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
// #Big_O_Time_O(n)_Space_O(n) #2023_12_26_Time_53_ms_(96.68%)_Space_39.3_MB_(10.78%)

using System;
using System.Collections.Generic;
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,8 @@ namespace LeetCodeNet.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_12_26_Time_69_ms_(92.74%)_Space_41.4_MB_(5.11%)
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
// #Big_O_Time_O(m+n)_Space_O(m+n) #2023_12_26_Time_69_ms_(92.74%)_Space_41.4_MB_(5.11%)

using LeetCodeNet.Com_github_leetcode;

Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0022_generate_parentheses/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2023_12_26_Time_81_ms_(99.57%)_Space_48.3_MB_(12.19%)
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
// #2023_12_26_Time_81_ms_(99.57%)_Space_48.3_MB_(12.19%)

using System.Collections.Generic;
using System.Text;
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0023_merge_k_sorted_lists/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.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_12_26_Time_78_ms_(98.24%)_Space_45_MB_(13.27%)
// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer
// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2023_12_26_Time_78_ms_(98.24%)_Space_45_MB_(13.27%)

using LeetCodeNet.Com_github_leetcode;

Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0025_reverse_nodes_in_k_group/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
namespace LeetCodeNet.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)
// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k)
// #2023_12_26_Time_75_ms_(86.97%)_Space_43.9_MB_(5.81%)

using LeetCodeNet.Com_github_leetcode;
Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ namespace LeetCodeNet.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)
// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
// #2023_12_28_Time_63_ms_(96.89%)_Space_41.1_MB_(5.40%)

public class Solution {
Expand Down
4 changes: 2 additions & 2 deletions ...eNet/G0001_0100/S0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.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)
// #2024_01_11_Time_120_ms_(81.66%)_Space_48.8_MB_(8.72%)
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search
// #Big_O_Time_O(log_n)_Space_O(1) #2024_01_11_Time_120_ms_(81.66%)_Space_48.8_MB_(8.72%)

public class Solution {
public int[] SearchRange(int[] nums, int target) {
Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0035_search_insert_position/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
namespace LeetCodeNet.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)
// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1)
// #2024_01_11_Time_64_ms_(95.18%)_Space_41.4_MB_(28.65%)

public class Solution {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0039_combination_sum/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2023_12_28_Time_94_ms_(99.60%)_Space_46.5_MB_(23.61%)
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
// #2023_12_28_Time_94_ms_(99.60%)_Space_46.5_MB_(23.61%)

using System.Collections.Generic;

Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2023_12_28_Time_81_ms_(89.96%)_Space_44.5_MB_(13.62%)
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
// #2023_12_28_Time_81_ms_(89.96%)_Space_44.5_MB_(13.62%)

public class Solution {
public int Trap(int[] height) {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2024_01_11_Time_85_ms_(88.80%)_Space_44.1_MB_(33.81%)
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
// #2024_01_11_Time_85_ms_(88.80%)_Space_44.1_MB_(33.81%)

public class Solution {
public int Jump(int[] nums) {
Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ namespace LeetCodeNet.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!)
// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!)
// #2024_01_11_Time_96_ms_(96.56%)_Space_46.4_MB_(12.40%)

using System.Collections.Generic;
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2024_01_04_Time_92_ms_(97.78%)_Space_45.7_MB_(9.23%)
// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
// #2024_01_04_Time_92_ms_(97.78%)_Space_45.7_MB_(9.23%)

public class Solution {
public void Rotate(int[][] matrix) {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2024_01_04_Time_145_ms_(96.20%)_Space_80.2_MB_(38.80%)
// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
// #2024_01_04_Time_145_ms_(96.20%)_Space_80.2_MB_(38.80%)

public class Solution {
public IList<IList<string>> GroupAnagrams(string[] strs) {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.G0001_0100.S0053_maximum_subarray {

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
// #Medium #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)
// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
// #2024_01_11_Time_270_ms_(38.35%)_Space_62.7_MB_(7.88%)

public class Solution {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2024_01_04_Time_189_ms_(38.02%)_Space_61.6_MB_(81.87%)
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
// #2024_01_04_Time_189_ms_(38.02%)_Space_61.6_MB_(81.87%)

public class Solution {
public bool CanJump(int[] nums) {
Expand Down
3 changes: 2 additions & 1 deletion LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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) #2024_01_05_Time_149_ms_(89.48%)_Space_55.6_MB_(11.71%)
// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
// #2024_01_05_Time_149_ms_(89.48%)_Space_55.6_MB_(11.71%)

public class Solution {
public int[][] Merge(int[][] intervals) {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.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)
// #2024_01_05_Time_74_ms_(94.37%)_Space_42.6_MB_(18.50%)
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_01_05_Time_74_ms_(94.37%)_Space_42.6_MB_(18.50%)

public class Solution {
public int MinPathSum(int[][] grid) {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,8 @@ namespace LeetCodeNet.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)
// #2024_01_05_Time_15_ms_(94.90%)_Space_26.2_MB_(96.48%)
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
// #Big_O_Time_O(n)_Space_O(n) #2024_01_05_Time_15_ms_(94.90%)_Space_26.2_MB_(96.48%)

public class Solution {
public int ClimbStairs(int n) {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.G0001_0100.S0072_edit_distance {

// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
// #Medium #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)
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
// #2024_01_05_Time_51_ms_(95.38%)_Space_44.5_MB_(20.65%)

public class Solution {
Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0073_set_matrix_zeroes/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
namespace LeetCodeNet.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)
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1)
// #2024_01_05_Time_124_ms_(96.92%)_Space_52_MB_(9.38%)

public class Solution {
Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@ namespace LeetCodeNet.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)
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1)
// #2024_01_05_Time_76_ms_(90.98%)_Space_43.2_MB_(9.93%)

public class Solution {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0076_minimum_window_substring/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.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)
// #2024_01_05_Time_56_ms_(98.72%)_Space_42.6_MB_(42.02%)
// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window
// #Big_O_Time_O(s.length())_Space_O(1) #2024_01_05_Time_56_ms_(98.72%)_Space_42.6_MB_(42.02%)

public class Solution {
public string MinWindow(string s, string t) {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0079_word_search/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
namespace LeetCodeNet.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)
// #2024_01_05_Time_152_ms_(99.69%)_Space_42.3_MB_(26.96%)
// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_01_05_Time_152_ms_(99.69%)_Space_42.3_MB_(26.96%)

public class Solution {
public bool Exist(char[][] board, string word) {
Expand Down
4 changes: 2 additions & 2 deletions LeetCodeNet/G0001_0100/S0096_unique_binary_search_trees/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
namespace LeetCodeNet.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)
// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
// #2024_01_08_Time_13_ms_(98.48%)_Space_26.2_MB_(88.64%)

public class Solution {
Expand Down
2 changes: 1 addition & 1 deletion LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs
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 #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))
// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N))
// #2024_01_08_Time_75_ms_(97.31%)_Space_45.3_MB_(19.73%)

using LeetCodeNet.Com_github_leetcode;
Expand Down Expand Up @@ -33,7 +33,7 @@
if (root.val <= left || root.val >= right) {
return false;
}
return Solve(root.left, left, (long)root.val) && Solve(root.right, (long)root.val, right);

Check warning on line 36 in LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs

View workflow job for this annotation

GitHub Actions / build-windows 

Nullable value type may be null.

Check warning on line 36 in LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs

View workflow job for this annotation

GitHub Actions / build-windows 

Nullable value type may be null.
}
}
}
3 changes: 2 additions & 1 deletion LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,8 @@ namespace LeetCodeNet.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)) #2024_01_08_Time_64_ms_(97.79%)_Space_42.9_MB_(23.56%)
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
// #2024_01_08_Time_64_ms_(97.79%)_Space_42.9_MB_(23.56%)

using LeetCodeNet.Com_github_leetcode;

Expand Down
Loading
Loading