Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitbefac22

Browse files
authored
Updated readme and tags
1 parentc4b10d7 commitbefac22

File tree

81 files changed

+872
-665
lines changed

Some content is hidden

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

81 files changed

+872
-665
lines changed

‎LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
namespaceLeetCodeNet.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)
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
56
// #2023_12_18_Time_134_ms_(81.26%)_Space_44.8_MB_(19.72%)
67

78
publicclassSolution{
@@ -18,4 +19,3 @@ public int[] TwoSum(int[] numbers, int target) {
1819
}
1920
}
2021
}
21-

‎LeetCodeNet/G0001_0100/S0002_add_two_numbers/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0002_add_two_numbers {
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)) #2023_12_19_Time_84_ms_(77.30%)_Space_49.4_MB_(51.01%)
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 #2023_12_19_Time_84_ms_(77.30%)_Space_49.4_MB_(51.01%)
67

78
usingLeetCodeNet.Com_github_leetcode;
89

‎LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0003_longest_substring_without_repeating_chara
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) #2023_12_22_Time_50_ms_(98.40%)_Space_41.9_MB_(30.26%)
5+
// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task
6+
// #2023_12_22_Time_50_ms_(98.40%)_Space_41.9_MB_(30.26%)
67

78
publicclassSolution{
89
publicintLengthOfLongestSubstring(strings){

‎LeetCodeNet/G0001_0100/S0004_median_of_two_sorted_arrays/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
namespaceLeetCodeNet.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) #2023_12_22_Time_83_ms_(96.35%)_Space_54_MB_(6.56%)
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 #2023_12_22_Time_83_ms_(96.35%)_Space_54_MB_(6.56%)
56

67
publicclassSolution{
78
publicdoubleFindMedianSortedArrays(int[]nums1,int[]nums2){

‎LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0005_longest_palindromic_substring {
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-
// #2023_12_22_Time_61_ms_(99.50%)_Space_40_MB_(56.86%)
5+
// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP
6+
// #Big_O_Time_O(n)_Space_O(n) #2023_12_22_Time_61_ms_(99.50%)_Space_40_MB_(56.86%)
77

88
publicclassSolution{
99
publicstringLongestPalindrome(strings){

‎LeetCodeNet/G0001_0100/S0006_zigzag_conversion/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
namespaceLeetCodeNet.G0001_0100.S0006_zigzag_conversion{
22

3-
// #Medium #String #2023_12_22_Time_59_ms_(99.87%)_Space_45.1_MB_(74.68%)
3+
// #Medium #String #Top_Interview_150_Array/String
4+
// #2023_12_22_Time_59_ms_(99.87%)_Space_45.1_MB_(74.68%)
45

56
usingSystem.Text;
67

‎LeetCodeNet/G0001_0100/S0009_palindrome_number/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
namespaceLeetCodeNet.G0001_0100.S0009_palindrome_number{
22

3-
// #Easy #Math #Udemy_Integers #2023_12_22_Time_42_ms_(34.61%)_Space_31_MB_(36.04%)
3+
// #Easy #Math #Udemy_Integers #Top_Interview_150_Math
4+
// #2023_12_22_Time_42_ms_(34.61%)_Space_31_MB_(36.04%)
45

56
publicclassSolution{
67
publicboolIsPalindrome(intx){

‎LeetCodeNet/G0001_0100/S0010_regular_expression_matching/Solution.cs

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
namespaceLeetCodeNet.G0001_0100.S0010_regular_expression_matching{
22

3-
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
4-
// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
5-
// #2023_12_22_Time_59_ms_(96.10%)_Space_40.5_MB_(47.63%)
3+
// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
4+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_12_22_Time_59_ms_(96.10%)_Space_40.5_MB_(47.63%)
65

76
publicclassSolution{
87
privatebool?[,]cache;

‎LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.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_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%)
66

77
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0015_3sum {
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) #2023_12_26_Time_173_ms_(75.85%)_Space_74.7_MB_(28.23%)
5+
// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2)
6+
// #2023_12_26_Time_173_ms_(75.85%)_Space_74.7_MB_(28.23%)
67

78
publicclassSolution{
89
publicIList<IList<int>>ThreeSum(int[]nums){

‎LeetCodeNet/G0001_0100/S0017_letter_combinations_of_a_phone_number/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0017_letter_combinations_of_a_phone_number {
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) #2023_12_26_Time_108_ms_(95.24%)_Space_46.3_MB_(5.39%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
6+
// #2023_12_26_Time_108_ms_(95.24%)_Space_46.3_MB_(5.39%)
67

78
usingSystem.Text;
89

‎LeetCodeNet/G0001_0100/S0019_remove_nth_node_from_end_of_list/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.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-
// #2023_12_26_Time_69_ms_(90.79%)_Space_40_MB_(5.04%)
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) #2023_12_26_Time_69_ms_(90.79%)_Space_40_MB_(5.04%)
66

77
usingLeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0001_0100/S0020_valid_parentheses/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.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-
// #2023_12_26_Time_53_ms_(96.68%)_Space_39.3_MB_(10.78%)
4+
// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack
5+
// #Big_O_Time_O(n)_Space_O(n) #2023_12_26_Time_53_ms_(96.68%)_Space_39.3_MB_(10.78%)
66

77
usingSystem;
88
usingSystem.Collections.Generic;

‎LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0021_merge_two_sorted_lists {
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-
// #2023_12_26_Time_69_ms_(92.74%)_Space_41.4_MB_(5.11%)
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) #2023_12_26_Time_69_ms_(92.74%)_Space_41.4_MB_(5.11%)
77

88
usingLeetCodeNet.Com_github_leetcode;
99

‎LeetCodeNet/G0001_0100/S0022_generate_parentheses/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0022_generate_parentheses {
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) #2023_12_26_Time_81_ms_(99.57%)_Space_48.3_MB_(12.19%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n)
6+
// #2023_12_26_Time_81_ms_(99.57%)_Space_48.3_MB_(12.19%)
67

78
usingSystem.Collections.Generic;
89
usingSystem.Text;

‎LeetCodeNet/G0001_0100/S0023_merge_k_sorted_lists/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.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-
// #2023_12_26_Time_78_ms_(98.24%)_Space_45_MB_(13.27%)
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)) #2023_12_26_Time_78_ms_(98.24%)_Space_45_MB_(13.27%)
66

77
usingLeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0001_0100/S0025_reverse_nodes_in_k_group/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.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
// #2023_12_26_Time_75_ms_(86.97%)_Space_43.9_MB_(5.81%)
66

77
usingLeetCodeNet.Com_github_leetcode;

‎LeetCodeNet/G0001_0100/S0033_search_in_rotated_sorted_array/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0033_search_in_rotated_sorted_array {
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
// #2023_12_28_Time_63_ms_(96.89%)_Space_41.1_MB_(5.40%)
77

88
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.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_01_11_Time_120_ms_(81.66%)_Space_48.8_MB_(8.72%)
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_01_11_Time_120_ms_(81.66%)_Space_48.8_MB_(8.72%)
66

77
publicclassSolution{
88
publicint[]SearchRange(int[]nums,inttarget){

‎LeetCodeNet/G0001_0100/S0035_search_insert_position/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.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_01_11_Time_64_ms_(95.18%)_Space_41.4_MB_(28.65%)
66

77
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0039_combination_sum/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0039_combination_sum {
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) #2023_12_28_Time_94_ms_(99.60%)_Space_46.5_MB_(23.61%)
5+
// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n)
6+
// #2023_12_28_Time_94_ms_(99.60%)_Space_46.5_MB_(23.61%)
67

78
usingSystem.Collections.Generic;
89

‎LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0042_trapping_rain_water {
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) #2023_12_28_Time_81_ms_(89.96%)_Space_44.5_MB_(13.62%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2023_12_28_Time_81_ms_(89.96%)_Space_44.5_MB_(13.62%)
67

78
publicclassSolution{
89
publicintTrap(int[]height){

‎LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0045_jump_game_ii {
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_01_11_Time_85_ms_(88.80%)_Space_44.1_MB_(33.81%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2024_01_11_Time_85_ms_(88.80%)_Space_44.1_MB_(33.81%)
67

78
publicclassSolution{
89
publicintJump(int[]nums){

‎LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0046_permutations {
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_01_11_Time_96_ms_(96.56%)_Space_46.4_MB_(12.40%)
77

88
usingSystem.Collections.Generic;

‎LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0048_rotate_image {
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_01_04_Time_92_ms_(97.78%)_Space_45.7_MB_(9.23%)
5+
// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
6+
// #2024_01_04_Time_92_ms_(97.78%)_Space_45.7_MB_(9.23%)
67

78
publicclassSolution{
89
publicvoidRotate(int[][]matrix){

‎LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0049_group_anagrams {
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_01_04_Time_145_ms_(96.20%)_Space_80.2_MB_(38.80%)
5+
// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
6+
// #2024_01_04_Time_145_ms_(96.20%)_Space_80.2_MB_(38.80%)
67

78
publicclassSolution{
89
publicIList<IList<string>>GroupAnagrams(string[]strs){

‎LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.G0001_0100.S0053_maximum_subarray{
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
3+
// #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_01_11_Time_270_ms_(38.35%)_Space_62.7_MB_(7.88%)
77

88
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0055_jump_game {
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_01_04_Time_189_ms_(38.02%)_Space_61.6_MB_(81.87%)
5+
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6+
// #2024_01_04_Time_189_ms_(38.02%)_Space_61.6_MB_(81.87%)
67

78
publicclassSolution{
89
publicboolCanJump(int[]nums){

‎LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0056_merge_intervals {
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_01_05_Time_149_ms_(89.48%)_Space_55.6_MB_(11.71%)
5+
// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
6+
// #2024_01_05_Time_149_ms_(89.48%)_Space_55.6_MB_(11.71%)
67

78
publicclassSolution{
89
publicint[][]Merge(int[][]intervals){

‎LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.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_01_05_Time_74_ms_(94.37%)_Space_42.6_MB_(18.50%)
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_01_05_Time_74_ms_(94.37%)_Space_42.6_MB_(18.50%)
66

77
publicclassSolution{
88
publicintMinPathSum(int[][]grid){

‎LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0070_climbing_stairs {
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_01_05_Time_15_ms_(94.90%)_Space_26.2_MB_(96.48%)
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_01_05_Time_15_ms_(94.90%)_Space_26.2_MB_(96.48%)
77

88
publicclassSolution{
99
publicintClimbStairs(intn){

‎LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.G0001_0100.S0072_edit_distance{
22

3-
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
3+
// #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_01_05_Time_51_ms_(95.38%)_Space_44.5_MB_(20.65%)
77

88
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0073_set_matrix_zeroes/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.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_01_05_Time_124_ms_(96.92%)_Space_52_MB_(9.38%)
66

77
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0074_search_a_2d_matrix {
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_01_05_Time_76_ms_(90.98%)_Space_43.2_MB_(9.93%)
77

88
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0076_minimum_window_substring/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.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_01_05_Time_56_ms_(98.72%)_Space_42.6_MB_(42.02%)
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_01_05_Time_56_ms_(98.72%)_Space_42.6_MB_(42.02%)
66

77
publicclassSolution{
88
publicstringMinWindow(strings,stringt){

‎LeetCodeNet/G0001_0100/S0079_word_search/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
namespaceLeetCodeNet.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_01_05_Time_152_ms_(99.69%)_Space_42.3_MB_(26.96%)
4+
// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
5+
// #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%)
66

77
publicclassSolution{
88
publicboolExist(char[][]board,stringword){

‎LeetCodeNet/G0001_0100/S0096_unique_binary_search_trees/Solution.cs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespaceLeetCodeNet.G0001_0100.S0096_unique_binary_search_trees{
22

3-
// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree
4-
// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
3+
// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
4+
// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
55
// #2024_01_08_Time_13_ms_(98.48%)_Space_26.2_MB_(88.64%)
66

77
publicclassSolution{

‎LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0098_validate_binary_search_tree {
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_01_08_Time_75_ms_(97.31%)_Space_45.3_MB_(19.73%)
77

88
usingLeetCodeNet.Com_github_leetcode;

‎LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,8 @@ namespace LeetCodeNet.G0101_0200.S0101_symmetric_tree {
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_01_08_Time_64_ms_(97.79%)_Space_42.9_MB_(23.56%)
5+
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
6+
// #2024_01_08_Time_64_ms_(97.79%)_Space_42.9_MB_(23.56%)
67

78
usingLeetCodeNet.Com_github_leetcode;
89

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp