Skip to content

Commit 5cf6c7a

Browse files
javadevjavadev
authored
Updated readme
1 parent bb5e67e commit 5cf6c7a

File tree

6 files changed

+92
-75
lines changed

6 files changed

+92
-75
lines changed

‎LeetCodeNet.Tests/G0101_0200/S0120_triangle/SolutionTest.cs

Lines changed: 20 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -1,26 +1,26 @@
11
namespace LeetCodeNet.G0101_0200.S0120_triangle {
22

3-
using Xunit;
4-
using System.Collections.Generic;
3+
using Xunit;
4+
using System.Collections.Generic;
55

6-
public class SolutionTest {
7-
[Fact]
8-
public void MinimumTotal() {
9-
var triangle = new List<IList<int>> {
10-
new List<int> {2},
11-
new List<int> {3, 4},
12-
new List<int> {6, 5, 7},
13-
new List<int> {4, 1, 8, 3}
14-
};
15-
Assert.Equal(11, new Solution().MinimumTotal(triangle));
16-
}
6+
public class SolutionTest {
7+
[Fact]
8+
public void MinimumTotal() {
9+
var triangle = new List<IList<int>> {
10+
new List<int> {2},
11+
new List<int> {3, 4},
12+
new List<int> {6, 5, 7},
13+
new List<int> {4, 1, 8, 3}
14+
};
15+
Assert.Equal(11, new Solution().MinimumTotal(triangle));
16+
}
1717

18-
[Fact]
19-
public void MinimumTotal2() {
20-
var triangle = new List<IList<int>> {
21-
new List<int> {-10}
22-
};
23-
Assert.Equal(-10, new Solution().MinimumTotal(triangle));
24-
}
18+
[Fact]
19+
public void MinimumTotal2() {
20+
var triangle = new List<IList<int>> {
21+
new List<int> {-10}
22+
};
23+
Assert.Equal(-10, new Solution().MinimumTotal(triangle));
2524
}
2625
}
26+
}

‎LeetCodeNet.Tests/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/SolutionTest.cs

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,21 @@
11
namespace LeetCodeNet.G0101_0200.S0122_best_time_to_buy_and_sell_stock_ii {
22

3-
using Xunit;
3+
using Xunit;
44

5-
public class SolutionTest {
6-
[Fact]
7-
public void MaxProfit() {
8-
Assert.Equal(7, new Solution().MaxProfit(new int[] {7, 1, 5, 3, 6, 4}));
9-
}
5+
public class SolutionTest {
6+
[Fact]
7+
public void MaxProfit() {
8+
Assert.Equal(7, new Solution().MaxProfit(new int[] {7, 1, 5, 3, 6, 4}));
9+
}
1010

11-
[Fact]
12-
public void MaxProfit2() {
13-
Assert.Equal(4, new Solution().MaxProfit(new int[] {1, 2, 3, 4, 5}));
14-
}
11+
[Fact]
12+
public void MaxProfit2() {
13+
Assert.Equal(4, new Solution().MaxProfit(new int[] {1, 2, 3, 4, 5}));
14+
}
1515

16-
[Fact]
17-
public void MaxProfit3() {
18-
Assert.Equal(0, new Solution().MaxProfit(new int[] {7, 6, 4, 3, 1}));
19-
}
16+
[Fact]
17+
public void MaxProfit3() {
18+
Assert.Equal(0, new Solution().MaxProfit(new int[] {7, 6, 4, 3, 1}));
2019
}
2120
}
21+
}

‎LeetCodeNet.Tests/G0101_0200/S0123_best_time_to_buy_and_sell_stock_iii/SolutionTest.cs

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,21 @@
11
namespace LeetCodeNet.G0101_0200.S0123_best_time_to_buy_and_sell_stock_iii {
22

3-
using Xunit;
3+
using Xunit;
44

5-
public class SolutionTest {
6-
[Fact]
7-
public void MaxProfit() {
8-
Assert.Equal(6, new Solution().MaxProfit(new int[] {3, 3, 5, 0, 0, 3, 1, 4}));
9-
}
5+
public class SolutionTest {
6+
[Fact]
7+
public void MaxProfit() {
8+
Assert.Equal(6, new Solution().MaxProfit(new int[] {3, 3, 5, 0, 0, 3, 1, 4}));
9+
}
1010

11-
[Fact]
12-
public void MaxProfit2() {
13-
Assert.Equal(4, new Solution().MaxProfit(new int[] {1, 2, 3, 4, 5}));
14-
}
11+
[Fact]
12+
public void MaxProfit2() {
13+
Assert.Equal(4, new Solution().MaxProfit(new int[] {1, 2, 3, 4, 5}));
14+
}
1515

16-
[Fact]
17-
public void MaxProfit3() {
18-
Assert.Equal(0, new Solution().MaxProfit(new int[] {7, 6, 4, 3, 1}));
19-
}
16+
[Fact]
17+
public void MaxProfit3() {
18+
Assert.Equal(0, new Solution().MaxProfit(new int[] {7, 6, 4, 3, 1}));
2019
}
2120
}
21+
}

‎LeetCodeNet.Tests/G0101_0200/S0125_valid_palindrome/SolutionTest.cs

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,21 +1,21 @@
11
namespace LeetCodeNet.G0101_0200.S0125_valid_palindrome {
22

3-
using Xunit;
3+
using Xunit;
44

5-
public class SolutionTest {
6-
[Fact]
7-
public void IsPalindrome() {
8-
Assert.True(new Solution().IsPalindrome("A man, a plan, a canal: Panama"));
9-
}
5+
public class SolutionTest {
6+
[Fact]
7+
public void IsPalindrome() {
8+
Assert.True(new Solution().IsPalindrome("A man, a plan, a canal: Panama"));
9+
}
1010

11-
[Fact]
12-
public void IsPalindrome2() {
13-
Assert.False(new Solution().IsPalindrome("race a car"));
14-
}
11+
[Fact]
12+
public void IsPalindrome2() {
13+
Assert.False(new Solution().IsPalindrome("race a car"));
14+
}
1515

16-
[Fact]
17-
public void IsPalindrome3() {
18-
Assert.True(new Solution().IsPalindrome(" "));
19-
}
16+
[Fact]
17+
public void IsPalindrome3() {
18+
Assert.True(new Solution().IsPalindrome(" "));
2019
}
2120
}
21+
}

‎LeetCodeNet.Tests/G0101_0200/S0127_word_ladder/SolutionTest.cs

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,19 @@
11
namespace LeetCodeNet.G0101_0200.S0127_word_ladder {
22

3-
using Xunit;
4-
using System.Collections.Generic;
3+
using Xunit;
4+
using System.Collections.Generic;
55

6-
public class SolutionTest {
7-
[Fact]
8-
public void LadderLength() {
9-
Assert.Equal(5, new Solution().LadderLength(
10-
"hit", "cog", new List<string> {"hot", "dot", "dog", "lot", "log", "cog"}));
11-
}
6+
public class SolutionTest {
7+
[Fact]
8+
public void LadderLength() {
9+
Assert.Equal(5, new Solution().LadderLength(
10+
"hit", "cog", new List<string> {"hot", "dot", "dog", "lot", "log", "cog"}));
11+
}
1212

13-
[Fact]
14-
public void LadderLength2() {
15-
Assert.Equal(0, new Solution().LadderLength(
16-
"hit", "cog", new List<string> {"hot", "dot", "dog", "lot", "log"}));
17-
}
13+
[Fact]
14+
public void LadderLength2() {
15+
Assert.Equal(0, new Solution().LadderLength(
16+
"hit", "cog", new List<string> {"hot", "dot", "dog", "lot", "log"}));
1817
}
1918
}
19+
}

‎README.md

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -268,6 +268,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
268268

269269
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
270270
|-|-|-|-|-|-
271+
| 0127 |[Word Ladder](LeetCodeNet/G0101_0200/S0127_word_ladder/Solution.cs)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 22 | 96.00
271272

272273
#### Day 13 Graph Theory
273274

@@ -585,6 +586,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
585586
| 0283 |[Move Zeroes](LeetCodeNet/G0201_0300/S0283_move_zeroes/Solution.cs)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 96.12
586587
| 0001 |[Two Sum](LeetCodeNet/G0001_0100/S0001_two_sum/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 1 | 98.51
587588
| 0058 |[Length of Last Word](LeetCodeNet/G0001_0100/S0058_length_of_last_word/Solution.cs)| Easy | String | 0 | 100.00
589+
| 0122 |[Best Time to Buy and Sell Stock II](LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 0 | 100.00
588590
| 0080 |[Remove Duplicates from Sorted Array II](LeetCodeNet/G0001_0100/S0080_remove_duplicates_from_sorted_array_ii/Solution.cs)| Medium | Array, Two_Pointers | 125 | 97.82
589591
| 0189 |[Rotate Array](LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
590592
| 0055 |[Jump Game](LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 1 | 99.82
@@ -598,6 +600,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
598600

599601
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
600602
|-|-|-|-|-|-
603+
| 0125 |[Valid Palindrome](LeetCodeNet/G0101_0200/S0125_valid_palindrome/Solution.cs)| Easy | Top_Interview_Questions, String, Two_Pointers | 1 | 99.79
601604
| 0026 |[Remove Duplicates from Sorted Array](LeetCodeNet/G0001_0100/S0026_remove_duplicates_from_sorted_array/Solution.cs)| Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00
602605
| 0042 |[Trapping Rain Water](LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 1 | 63.59
603606
| 0015 |[3Sum](LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 34 | 76.14
@@ -673,6 +676,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
673676

674677
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
675678
|-|-|-|-|-|-
679+
| 0120 |[Triangle](LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs)| Medium | Array, Dynamic_Programming | 2 | 90.53
676680
| 0139 |[Word Break](LeetCodeNet/G0101_0200/S0139_word_break/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 6 | 55.14
677681
| 0152 |[Maximum Product Subarray](LeetCodeNet/G0101_0200/S0152_maximum_product_subarray/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
678682
| 0198 |[House Robber](LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
@@ -718,6 +722,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
718722
| 0169 |[Majority Element](LeetCodeNet/G0101_0200/S0169_majority_element/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 66.60
719723
| 0189 |[Rotate Array](LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
720724
| 0121 |[Best Time to Buy and Sell Stock](LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 100.00
725+
| 0122 |[Best Time to Buy and Sell Stock II](LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 0 | 100.00
721726
| 0055 |[Jump Game](LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 1 | 99.82
722727
| 0045 |[Jump Game II](LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
723728
| 0238 |[Product of Array Except Self](LeetCodeNet/G0201_0300/S0238_product_of_array_except_self/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 100.00
@@ -734,6 +739,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
734739

735740
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
736741
|-|-|-|-|-|-
742+
| 0125 |[Valid Palindrome](LeetCodeNet/G0101_0200/S0125_valid_palindrome/Solution.cs)| Easy | Top_Interview_Questions, String, Two_Pointers | 1 | 99.79
737743
| 0011 |[Container With Most Water](LeetCodeNet/G0001_0100/S0011_container_with_most_water/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 1 | 99.97
738744
| 0015 |[3Sum](LeetCodeNet/G0001_0100/S0015_3sum/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 34 | 76.14
739745

@@ -834,6 +840,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
834840

835841
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
836842
|-|-|-|-|-|-
843+
| 0127 |[Word Ladder](LeetCodeNet/G0101_0200/S0127_word_ladder/Solution.cs)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 22 | 96.00
837844

838845
#### Top Interview 150 Trie
839846

@@ -915,11 +922,13 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
915922

916923
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
917924
|-|-|-|-|-|-
925+
| 0120 |[Triangle](LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs)| Medium | Array, Dynamic_Programming | 2 | 90.53
918926
| 0064 |[Minimum Path Sum](LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 1 | 100.00
919927
| 0063 |[Unique Paths II](LeetCodeNet/G0001_0100/S0063_unique_paths_ii/Solution.cs)| Medium | Array, Dynamic_Programming, Matrix | 0 | 100.00
920928
| 0005 |[Longest Palindromic Substring](LeetCodeNet/G0001_0100/S0005_longest_palindromic_substring/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 7 | 95.82
921929
| 0097 |[Interleaving String](LeetCodeNet/G0001_0100/S0097_interleaving_string/Solution.cs)| Medium | String, Dynamic_Programming | 56 | 87.55
922930
| 0072 |[Edit Distance](LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 4 | 89.69
931+
| 0123 |[Best Time to Buy and Sell Stock III](LeetCodeNet/G0101_0200/S0123_best_time_to_buy_and_sell_stock_iii/Solution.cs)| Hard | Array, Dynamic_Programming | 3 | 86.18
923932
| 0221 |[Maximal Square](LeetCodeNet/G0201_0300/S0221_maximal_square/Solution.cs)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 3 | 96.90
924933

925934
### Data Structure I
@@ -1216,6 +1225,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
12161225
|-|-|-|-|-|-
12171226
| 0070 |[Climbing Stairs](LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
12181227
| 0198 |[House Robber](LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
1228+
| 0120 |[Triangle](LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs)| Medium | Array, Dynamic_Programming | 2 | 90.53
12191229

12201230
#### Day 13 Bit Manipulation
12211231

@@ -1575,6 +1585,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
15751585
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
15761586
|-|-|-|-|-|-
15771587
| 0121 |[Best Time to Buy and Sell Stock](LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 100.00
1588+
| 0122 |[Best Time to Buy and Sell Stock II](LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 0 | 100.00
15781589

15791590
#### Day 8
15801591

@@ -1608,6 +1619,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
16081619

16091620
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
16101621
|-|-|-|-|-|-
1622+
| 0120 |[Triangle](LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs)| Medium | Array, Dynamic_Programming | 2 | 90.53
16111623

16121624
#### Day 14
16131625

@@ -1709,8 +1721,13 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
17091721
| 0136 |[Single Number](LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Top_Interview_150_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
17101722
| 0131 |[Palindrome Partitioning](LeetCodeNet/G0101_0200/S0131_palindrome_partitioning/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N\*2^N)_Space_O(2^N\*N) | 19 | 39.67
17111723
| 0128 |[Longest Consecutive Sequence](LeetCodeNet/G0101_0200/S0128_longest_consecutive_sequence/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Top_Interview_150_Hashmap, Big_O_Time_O(N_log_N)_Space_O(1) | 16 | 100.00
1724+
| 0127 |[Word Ladder](LeetCodeNet/G0101_0200/S0127_word_ladder/Solution.cs)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search, Top_Interview_150_Graph_BFS | 22 | 96.00
1725+
| 0125 |[Valid Palindrome](LeetCodeNet/G0101_0200/S0125_valid_palindrome/Solution.cs)| Easy | Top_Interview_Questions, String, Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Two_Pointers | 1 | 99.79
17121726
| 0124 |[Binary Tree Maximum Path Sum](LeetCodeNet/G0101_0200/S0124_binary_tree_maximum_path_sum/Solution.cs)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
1727+
| 0123 |[Best Time to Buy and Sell Stock III](LeetCodeNet/G0101_0200/S0123_best_time_to_buy_and_sell_stock_iii/Solution.cs)| Hard | Array, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 3 | 86.18
1728+
| 0122 |[Best Time to Buy and Sell Stock II](LeetCodeNet/G0101_0200/S0122_best_time_to_buy_and_sell_stock_ii/Solution.cs)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7, Udemy_Arrays, Top_Interview_150_Array/String | 0 | 100.00
17131729
| 0121 |[Best Time to Buy and Sell Stock](LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(N)_Space_O(1) | 1 | 100.00
1730+
| 0120 |[Triangle](LeetCodeNet/G0101_0200/S0120_triangle/Solution.cs)| Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 2 | 90.53
17141731
| 0117 |[Populating Next Right Pointers in Each Node II](LeetCodeNet/G0101_0200/S0117_populating_next_right_pointers_in_each_node_ii/Solution.cs)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List, Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search, Top_Interview_150_Binary_Tree_General | 69 | 98.05
17151732
| 0114 |[Flatten Binary Tree to Linked List](LeetCodeNet/G0101_0200/S0114_flatten_binary_tree_to_linked_list/Solution.cs)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
17161733
| 0112 |[Path Sum](LeetCodeNet/G0101_0200/S0112_path_sum/Solution.cs)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Top_Interview_150_Binary_Tree_General | 0 | 100.00

0 commit comments

Comments
 (0)