Skip to content

Commit 74e6a58

Browse files
javadevjavadev
authored
Updated readme
1 parent 9dd3b91 commit 74e6a58

File tree

1 file changed

+29
-0
lines changed

1 file changed

+29
-0
lines changed

‎README.md‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -87,6 +87,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
8787

8888
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
8989
|-|-|-|-|-|-
90+
| 0127 |[Word Ladder](src/main/python/g0101_0200/s0127_word_ladder/Solution0127.py)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 21 | 99.65
9091

9192
#### Day 13 Graph Theory
9293

@@ -403,6 +404,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
403404
| 0283 |[Move Zeroes](src/main/python/g0201_0300/s0283_move_zeroes/Solution0283.py)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 80.05
404405
| 0001 |[Two Sum](src/main/python/g0001_0100/s0001_two_sum/Solution0001.py)| 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 | 0 | 100.00
405406
| 0058 |[Length of Last Word](src/main/python/g0001_0100/s0058_length_of_last_word/Solution0058.py)| Easy | String | 0 | 100.00
407+
| 0122 |[Best Time to Buy and Sell Stock II](src/main/python/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution0122.py)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 0 | 100.00
406408
| 0080 |[Remove Duplicates from Sorted Array II](src/main/python/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution0080.py)| Medium | Array, Two_Pointers | 73 | 96.40
407409
| 0189 |[Rotate Array](src/main/python/g0101_0200/s0189_rotate_array/Solution0189.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 74.65
408410
| 0055 |[Jump Game](src/main/python/g0001_0100/s0055_jump_game/Solution0055.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 12 | 85.38
@@ -416,6 +418,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
416418

417419
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
418420
|-|-|-|-|-|-
421+
| 0125 |[Valid Palindrome](src/main/python/g0101_0200/s0125_valid_palindrome/Solution0125.py)| Hard | Array, Dynamic_Programming | 232 | 75.22
419422
| 0026 |[Remove Duplicates from Sorted Array](src/main/python/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution0026.py)| Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00
420423
| 0042 |[Trapping Rain Water](src/main/python/g0001_0100/s0042_trapping_rain_water/Solution0042.py)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 11 | 71.16
421424
| 0015 |[3Sum](src/main/python/g0001_0100/s0015_3sum/Solution0015.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 581 | 56.92
@@ -486,11 +489,13 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
486489
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
487490
|-|-|-|-|-|-
488491
| 0200 |[Number of Islands](src/main/python/g0101_0200/s0200_number_of_islands/Solution0200.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 234 | 82.73
492+
| 0133 |[Clone Graph](src/main/python/g0101_0200/s0133_clone_graph/Solution0133.py)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 38 | 86.28
489493

490494
#### Udemy Dynamic Programming
491495

492496
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
493497
|-|-|-|-|-|-
498+
| 0120 |[Triangle](src/main/python/g0101_0200/s0120_triangle/Solution0120.py)| Medium | Array, Dynamic_Programming | 0 | 100.00
494499
| 0139 |[Word Break](src/main/python/g0101_0200/s0139_word_break/Solution0139.py)| 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) | 3 | 70.59
495500
| 0152 |[Maximum Product Subarray](src/main/python/g0101_0200/s0152_maximum_product_subarray/Solution0152.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 3 | 98.51
496501
| 0198 |[House Robber](src/main/python/g0101_0200/s0198_house_robber/Solution0198.py)| 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
@@ -536,9 +541,12 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
536541
| 0169 |[Majority Element](src/main/python/g0101_0200/s0169_majority_element/Solution0169.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 7 | 56.72
537542
| 0189 |[Rotate Array](src/main/python/g0101_0200/s0189_rotate_array/Solution0189.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 74.65
538543
| 0121 |[Best Time to Buy and Sell Stock](src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution0121.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 17 | 98.03
544+
| 0122 |[Best Time to Buy and Sell Stock II](src/main/python/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution0122.py)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 0 | 100.00
539545
| 0055 |[Jump Game](src/main/python/g0001_0100/s0055_jump_game/Solution0055.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 12 | 85.38
540546
| 0045 |[Jump Game II](src/main/python/g0001_0100/s0045_jump_game_ii/Solution0045.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 8 | 57.34
541547
| 0238 |[Product of Array Except Self](src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution0238.py)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 15 | 97.12
548+
| 0134 |[Gas Station](src/main/python/g0101_0200/s0134_gas_station/Solution0134.py)| Medium | Top_Interview_Questions, Array, Greedy | 15 | 88.80
549+
| 0135 |[Candy](src/main/python/g0101_0200/s0135_candy/Solution0135.py)| Hard | Array, Greedy | 7 | 97.91
542550
| 0042 |[Trapping Rain Water](src/main/python/g0001_0100/s0042_trapping_rain_water/Solution0042.py)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 11 | 71.16
543551
| 0013 |[Roman to Integer](src/main/python/g0001_0100/s0013_roman_to_integer/Solution0013.py)| Easy | Top_Interview_Questions, String, Hash_Table, Math, Big_O_Time_O(n)_Space_O(1) | 1 | 86.91
544552
| 0012 |[Integer to Roman](src/main/python/g0001_0100/s0012_integer_to_roman/Solution0012.py)| Medium | String, Hash_Table, Math, Big_O_Time_O(1)_Space_O(1) | 0 | 100.00
@@ -552,6 +560,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
552560

553561
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
554562
|-|-|-|-|-|-
563+
| 0125 |[Valid Palindrome](src/main/python/g0101_0200/s0125_valid_palindrome/Solution0125.py)| Hard | Array, Dynamic_Programming | 232 | 75.22
555564
| 0011 |[Container With Most Water](src/main/python/g0001_0100/s0011_container_with_most_water/Solution0011.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 68 | 91.16
556565
| 0015 |[3Sum](src/main/python/g0001_0100/s0015_3sum/Solution0015.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 581 | 56.92
557566

@@ -624,6 +633,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
624633
| 0117 |[Populating Next Right Pointers in Each Node II](src/main/python/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution0117.py)| Medium | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 44 | 70.94
625634
| 0114 |[Flatten Binary Tree to Linked List](src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution0114.py)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
626635
| 0112 |[Path Sum](src/main/python/g0101_0200/s0112_path_sum/Solution0112.py)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
636+
| 0129 |[Sum Root to Leaf Numbers](src/main/python/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution0129.py)| Medium | Depth_First_Search, Tree, Binary_Tree | 0 | 100.00
627637
| 0124 |[Binary Tree Maximum Path Sum](src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution0124.py)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 11 | 91.40
628638
| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution0236.py)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 41 | 97.74
629639

@@ -646,12 +656,15 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
646656
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
647657
|-|-|-|-|-|-
648658
| 0200 |[Number of Islands](src/main/python/g0101_0200/s0200_number_of_islands/Solution0200.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 234 | 82.73
659+
| 0130 |[Surrounded Regions](src/main/python/g0101_0200/s0130_surrounded_regions/Solution0130.py)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 86.86
660+
| 0133 |[Clone Graph](src/main/python/g0101_0200/s0133_clone_graph/Solution0133.py)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 38 | 86.28
649661
| 0207 |[Course Schedule](src/main/python/g0201_0300/s0207_course_schedule/Solution0207.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Big_O_Time_O(N)_Space_O(N) | 3 | 88.23
650662

651663
#### Top Interview 150 Graph BFS
652664

653665
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
654666
|-|-|-|-|-|-
667+
| 0127 |[Word Ladder](src/main/python/g0101_0200/s0127_word_ladder/Solution0127.py)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 21 | 99.65
655668

656669
#### Top Interview 150 Trie
657670

@@ -730,11 +743,13 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
730743

731744
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
732745
|-|-|-|-|-|-
746+
| 0120 |[Triangle](src/main/python/g0101_0200/s0120_triangle/Solution0120.py)| Medium | Array, Dynamic_Programming | 0 | 100.00
733747
| 0064 |[Minimum Path Sum](src/main/python/g0001_0100/s0064_minimum_path_sum/Solution0064.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 15 | 60.38
734748
| 0063 |[Unique Paths II](src/main/python/g0001_0100/s0063_unique_paths_ii/Solution0063.py)| Medium | Array, Dynamic_Programming, Matrix | 0 | 100.00
735749
| 0005 |[Longest Palindromic Substring](src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution0005.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 47 | 97.38
736750
| 0097 |[Interleaving String](src/main/python/g0001_0100/s0097_interleaving_string/Solution0097.py)| Medium | String, Dynamic_Programming | 37 | 90.93
737751
| 0072 |[Edit Distance](src/main/python/g0001_0100/s0072_edit_distance/Solution0072.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 23 | 98.84
752+
| 0123 |[Best Time to Buy and Sell Stock III](src/main/python/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution0123.py)| Hard | Array, Dynamic_Programming | 232 | 75.22
738753
| 0221 |[Maximal Square](src/main/python/g0201_0300/s0221_maximal_square/Solution0221.py)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 129 | 64.49
739754

740755
### Data Structure I
@@ -1031,6 +1046,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
10311046
|-|-|-|-|-|-
10321047
| 0070 |[Climbing Stairs](src/main/python/g0001_0100/s0070_climbing_stairs/Solution0070.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
10331048
| 0198 |[House Robber](src/main/python/g0101_0200/s0198_house_robber/Solution0198.py)| 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
1049+
| 0120 |[Triangle](src/main/python/g0101_0200/s0120_triangle/Solution0120.py)| Medium | Array, Dynamic_Programming | 0 | 100.00
10341050

10351051
#### Day 13 Bit Manipulation
10361052

@@ -1094,6 +1110,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
10941110

10951111
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10961112
|-|-|-|-|-|-
1113+
| 0130 |[Surrounded Regions](src/main/python/g0101_0200/s0130_surrounded_regions/Solution0130.py)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 86.86
10971114

10981115
#### Day 9 Recursion Backtracking
10991116

@@ -1389,6 +1406,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
13891406
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13901407
|-|-|-|-|-|-
13911408
| 0121 |[Best Time to Buy and Sell Stock](src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution0121.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 17 | 98.03
1409+
| 0122 |[Best Time to Buy and Sell Stock II](src/main/python/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution0122.py)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy | 0 | 100.00
13921410

13931411
#### Day 8
13941412

@@ -1422,6 +1440,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
14221440

14231441
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
14241442
|-|-|-|-|-|-
1443+
| 0120 |[Triangle](src/main/python/g0101_0200/s0120_triangle/Solution0120.py)| Medium | Array, Dynamic_Programming | 0 | 100.00
14251444

14261445
#### Day 14
14271446

@@ -1700,10 +1719,20 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
17001719
| 0139 |[Word Break](src/main/python/g0101_0200/s0139_word_break/Solution0139.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 3 | 70.59
17011720
| 0138 |[Copy List with Random Pointer](src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution0138.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(N) | 38 | 77.31
17021721
| 0136 |[Single Number](src/main/python/g0101_0200/s0136_single_number/Solution0136.py)| 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
1722+
| 0135 |[Candy](src/main/python/g0101_0200/s0135_candy/Solution0135.py)| Hard | Array, Greedy, Top_Interview_150_Array/String | 7 | 97.91
1723+
| 0134 |[Gas Station](src/main/python/g0101_0200/s0134_gas_station/Solution0134.py)| Medium | Top_Interview_Questions, Array, Greedy, Top_Interview_150_Array/String | 15 | 88.80
1724+
| 0133 |[Clone Graph](src/main/python/g0101_0200/s0133_clone_graph/Solution0133.py)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph, Udemy_Graph, Top_Interview_150_Graph_General | 38 | 86.28
17031725
| 0131 |[Palindrome Partitioning](src/main/python/g0101_0200/s0131_palindrome_partitioning/Solution0131.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N\*2^N)_Space_O(2^N\*N) | 50 | 56.82
1726+
| 0130 |[Surrounded Regions](src/main/python/g0101_0200/s0130_surrounded_regions/Solution0130.py)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_8_Breadth_First_Search_Depth_First_Search, Top_Interview_150_Graph_General | 3 | 86.86
1727+
| 0129 |[Sum Root to Leaf Numbers](src/main/python/g0101_0200/s0129_sum_root_to_leaf_numbers/Solution0129.py)| Medium | Depth_First_Search, Tree, Binary_Tree, Top_Interview_150_Binary_Tree_General | 0 | 100.00
17041728
| 0128 |[Longest Consecutive Sequence](src/main/python/g0101_0200/s0128_longest_consecutive_sequence/Solution0128.py)| 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) | 47 | 76.47
1729+
| 0127 |[Word Ladder](src/main/python/g0101_0200/s0127_word_ladder/Solution0127.py)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search, Graph_Theory_I_Day_12_Breadth_First_Search, Top_Interview_150_Graph_BFS | 21 | 99.65
1730+
| 0125 |[Valid Palindrome](src/main/python/g0101_0200/s0125_valid_palindrome/Solution0125.py)| Hard | Array, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 232 | 75.22
17051731
| 0124 |[Binary Tree Maximum Path Sum](src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution0124.py)| 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) | 11 | 91.40
1732+
| 0123 |[Best Time to Buy and Sell Stock III](src/main/python/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii/Solution0123.py)| Hard | Array, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 232 | 75.22
1733+
| 0122 |[Best Time to Buy and Sell Stock II](src/main/python/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii/Solution0122.py)| Medium | Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Dynamic_Programming_I_Day_7, Udemy_Arrays, Top_Interview_150_Array/String | 0 | 100.00
17061734
| 0121 |[Best Time to Buy and Sell Stock](src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution0121.py)| 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) | 17 | 98.03
1735+
| 0120 |[Triangle](src/main/python/g0101_0200/s0120_triangle/Solution0120.py)| Medium | Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_13, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 0 | 100.00
17071736
| 0117 |[Populating Next Right Pointers in Each Node II](src/main/python/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii/Solution0117.py)| 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 | 44 | 70.94
17081737
| 0114 |[Flatten Binary Tree to Linked List](src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution0114.py)| 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
17091738
| 0112 |[Path Sum](src/main/python/g0101_0200/s0112_path_sum/Solution0112.py)| 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)