Skip to content

Commit c28598a

Browse files
javadevjavadev
authored
Updated readme
1 parent 35a5e33 commit c28598a

File tree

1 file changed

+33
-0
lines changed

1 file changed

+33
-0
lines changed

‎README.md

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

3939
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
4040
|-|-|-|-|-|-
41+
| 0191 |[Number of 1 Bits](LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
4142

4243
#### Day 3 Conditional Statements
4344

@@ -48,6 +49,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
4849

4950
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
5051
|-|-|-|-|-|-
52+
| 0202 |[Happy Number](LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 0 | 100.00
5153

5254
#### Day 5 Function
5355

@@ -345,6 +347,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
345347

346348
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
347349
|-|-|-|-|-|-
350+
| 0205 |[Isomorphic Strings](LeetCodeNet/G0201_0300/S0205_isomorphic_strings/Solution.cs)| Easy | String, Hash_Table | 2 | 90.78
348351

349352
#### Day 3 Linked List
350353

@@ -429,6 +432,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
429432

430433
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
431434
|-|-|-|-|-|-
435+
| 0202 |[Happy Number](LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 0 | 100.00
432436
| 0054 |[Spiral Matrix](LeetCodeNet/G0001_0100/S0054_spiral_matrix/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Simulation | 0 | 100.00
433437

434438
#### Day 2 String
@@ -492,6 +496,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
492496

493497
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
494498
|-|-|-|-|-|-
499+
| 0210 |[Course Schedule II](LeetCodeNet/G0201_0300/S0210_course_schedule_ii/Solution.cs)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 4 | 91.35
495500

496501
#### Day 12 Dynamic Programming
497502

@@ -520,6 +525,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
520525
|-|-|-|-|-|-
521526
| 0100 |[Same Tree](LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
522527
| 0101 |[Symmetric Tree](LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
528+
| 0199 |[Binary Tree Right Side View](LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 0 | 100.00
523529

524530
#### Day 16 Design
525531

@@ -707,6 +713,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
707713

708714
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
709715
|-|-|-|-|-|-
716+
| 0191 |[Number of 1 Bits](LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
710717
| 0190 |[Reverse Bits](LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 18 | 93.43
711718
| 0338 |[Counting Bits](LeetCodeNet/G0301_0400/S0338_counting_bits/Solution.cs)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 0 | 100.00
712719

@@ -758,6 +765,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
758765

759766
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
760767
|-|-|-|-|-|-
768+
| 0209 |[Minimum Size Subarray Sum](LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 0 | 100.00
761769
| 0003 |[Longest Substring Without Repeating Characters](LeetCodeNet/G0001_0100/S0003_longest_substring_without_repeating_characters/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 3 | 96.84
762770
| 0030 |[Substring with Concatenation of All Words](LeetCodeNet/G0001_0100/S0030_substring_with_concatenation_of_all_words/Solution.cs)| Hard | String, Hash_Table, Sliding_Window | 15 | 94.14
763771
| 0076 |[Minimum Window Substring](LeetCodeNet/G0001_0100/S0076_minimum_window_substring/Solution.cs)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 3 | 99.36
@@ -775,8 +783,11 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
775783

776784
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
777785
|-|-|-|-|-|-
786+
| 0205 |[Isomorphic Strings](LeetCodeNet/G0201_0300/S0205_isomorphic_strings/Solution.cs)| Easy | String, Hash_Table | 2 | 90.78
778787
| 0049 |[Group Anagrams](LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 17 | 83.74
779788
| 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
789+
| 0202 |[Happy Number](LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 0 | 100.00
790+
| 0219 |[Contains Duplicate II](LeetCodeNet/G0201_0300/S0219_contains_duplicate_ii/Solution.cs)| Easy | Array, Hash_Table, Sliding_Window | 12 | 98.14
780791
| 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, Big_O_Time_O(N_log_N)_Space_O(1) | 16 | 100.00
781792

782793
#### Top Interview 150 Intervals
@@ -833,6 +844,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
833844

834845
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
835846
|-|-|-|-|-|-
847+
| 0199 |[Binary Tree Right Side View](LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 0 | 100.00
836848
| 0102 |[Binary Tree Level Order Traversal](LeetCodeNet/G0101_0200/S0102_binary_tree_level_order_traversal/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
837849
| 0103 |[Binary Tree Zigzag Level Order Traversal](LeetCodeNet/G0101_0200/S0103_binary_tree_zigzag_level_order_traversal/Solution.cs)| Medium | Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
838850

@@ -851,6 +863,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
851863
| 0130 |[Surrounded Regions](LeetCodeNet/G0101_0200/S0130_surrounded_regions/Solution.cs)| Medium | Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 1 | 100.00
852864
| 0133 |[Clone Graph](LeetCodeNet/G0101_0200/S0133_clone_graph/Solution.cs)| Medium | Hash_Table, Depth_First_Search, Breadth_First_Search, Graph | 117 | 96.34
853865
| 0207 |[Course Schedule](LeetCodeNet/G0201_0300/S0207_course_schedule/Solution.cs)| 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) | 4 | 91.60
866+
| 0210 |[Course Schedule II](LeetCodeNet/G0201_0300/S0210_course_schedule_ii/Solution.cs)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 4 | 91.35
854867

855868
#### Top Interview 150 Graph BFS
856869

@@ -863,6 +876,8 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
863876
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
864877
|-|-|-|-|-|-
865878
| 0208 |[Implement Trie (Prefix Tree)](LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 7 | 100.00
879+
| 0211 |[Design Add and Search Words Data Structure](LeetCodeNet/G0201_0300/S0211_design_add_and_search_words_data_structure/WordDictionary.cs)| Medium | String, Depth_First_Search, Design, Trie | 380 | 93.39
880+
| 0212 |[Word Search II](LeetCodeNet/G0201_0300/S0212_word_search_ii/Solution.cs)| Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie | 29 | 100.00
866881

867882
#### Top Interview 150 Backtracking
868883

@@ -915,8 +930,10 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
915930
|-|-|-|-|-|-
916931
| 0067 |[Add Binary](LeetCodeNet/G0001_0100/S0067_add_binary/Solution.cs)| Easy | String, Math, Bit_Manipulation, Simulation | 1 | 91.47
917932
| 0190 |[Reverse Bits](LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 18 | 93.43
933+
| 0191 |[Number of 1 Bits](LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
918934
| 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, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
919935
| 0137 |[Single Number II](LeetCodeNet/G0101_0200/S0137_single_number_ii/Solution.cs)| Medium | Array, Bit_Manipulation | 0 | 100.00
936+
| 0201 |[Bitwise AND of Numbers Range](LeetCodeNet/G0201_0300/S0201_bitwise_and_of_numbers_range/Solution.cs)| Medium | Bit_Manipulation | 1 | 96.12
920937

921938
#### Top Interview 150 Math
922939

@@ -1145,6 +1162,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
11451162

11461163
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11471164
|-|-|-|-|-|-
1165+
| 0199 |[Binary Tree Right Side View](LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS | 0 | 100.00
11481166

11491167
#### Day 17 Tree
11501168

@@ -1255,6 +1273,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
12551273

12561274
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12571275
|-|-|-|-|-|-
1276+
| 0191 |[Number of 1 Bits](LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation | 0 | 100.00
12581277

12591278
#### Day 14 Bit Manipulation
12601279

@@ -1298,6 +1317,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
12981317
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12991318
|-|-|-|-|-|-
13001319
| 0438 |[Find All Anagrams in a String](LeetCodeNet/G0401_0500/S0438_find_all_anagrams_in_a_string/Solution.cs)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 3 | 97.66
1320+
| 0209 |[Minimum Size Subarray Sum](LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 0 | 100.00
13011321

13021322
#### Day 6 Breadth First Search Depth First Search
13031323

@@ -1385,6 +1405,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
13851405

13861406
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13871407
|-|-|-|-|-|-
1408+
| 0201 |[Bitwise AND of Numbers Range](LeetCodeNet/G0201_0300/S0201_bitwise_and_of_numbers_range/Solution.cs)| Medium | Bit_Manipulation | 1 | 96.12
13881409

13891410
#### Day 20 Others
13901411

@@ -1395,6 +1416,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
13951416

13961417
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13971418
|-|-|-|-|-|-
1419+
| 0202 |[Happy Number](LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 0 | 100.00
13981420
| 0149 |[Max Points on a Line](LeetCodeNet/G0101_0200/S0149_max_points_on_a_line/Solution.cs)| Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry | 5 | 100.00
13991421

14001422
### Binary Search I
@@ -1472,6 +1494,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
14721494

14731495
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
14741496
|-|-|-|-|-|-
1497+
| 0209 |[Minimum Size Subarray Sum](LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 0 | 100.00
14751498

14761499
#### Day 2
14771500

@@ -1730,12 +1753,22 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
17301753
| 0230 |[Kth Smallest Element in a BST](LeetCodeNet/G0201_0300/S0230_kth_smallest_element_in_a_bst/Solution.cs)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
17311754
| 0226 |[Invert Binary Tree](LeetCodeNet/G0201_0300/S0226_invert_binary_tree/Solution.cs)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
17321755
| 0221 |[Maximal Square](LeetCodeNet/G0201_0300/S0221_maximal_square/Solution.cs)| Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m\*n)_Space_O(m\*n) | 3 | 96.90
1756+
| 0219 |[Contains Duplicate II](LeetCodeNet/G0201_0300/S0219_contains_duplicate_ii/Solution.cs)| Easy | Array, Hash_Table, Sliding_Window, Top_Interview_150_Hashmap | 12 | 98.14
17331757
| 0215 |[Kth Largest Element in an Array](LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Data_Structure_II_Day_20_Heap_Priority_Queue, Top_Interview_150_Heap, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 85 | 88.50
1758+
| 0212 |[Word Search II](LeetCodeNet/G0201_0300/S0212_word_search_ii/Solution.cs)| Hard | Top_Interview_Questions, Array, String, Matrix, Backtracking, Trie, Top_Interview_150_Trie | 29 | 100.00
1759+
| 0211 |[Design Add and Search Words Data Structure](LeetCodeNet/G0201_0300/S0211_design_add_and_search_words_data_structure/WordDictionary.cs)| Medium | String, Depth_First_Search, Design, Trie, Top_Interview_150_Trie | 380 | 93.39
1760+
| 0210 |[Course Schedule II](LeetCodeNet/G0201_0300/S0210_course_schedule_ii/Solution.cs)| Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Level_2_Day_11_Graph/BFS/DFS, Top_Interview_150_Graph_General | 4 | 91.35
1761+
| 0209 |[Minimum Size Subarray Sum](LeetCodeNet/G0201_0300/S0209_minimum_size_subarray_sum/Solution.cs)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Binary_Search_II_Day_1, Top_Interview_150_Sliding_Window | 0 | 100.00
17341762
| 0208 |[Implement Trie (Prefix Tree)](LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Top_Interview_150_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 7 | 100.00
17351763
| 0207 |[Course Schedule](LeetCodeNet/G0201_0300/S0207_course_schedule/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Top_Interview_150_Graph_General, Big_O_Time_O(N)_Space_O(N) | 4 | 91.60
17361764
| 0206 |[Reverse Linked List](LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
1765+
| 0205 |[Isomorphic Strings](LeetCodeNet/G0201_0300/S0205_isomorphic_strings/Solution.cs)| Easy | String, Hash_Table, Level_1_Day_2_String, Top_Interview_150_Hashmap | 2 | 90.78
1766+
| 0202 |[Happy Number](LeetCodeNet/G0201_0300/S0202_happy_number/Solution.cs)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers, Algorithm_II_Day_21_Others, Programming_Skills_I_Day_4_Loop, Level_2_Day_1_Implementation/Simulation, Top_Interview_150_Hashmap | 0 | 100.00
1767+
| 0201 |[Bitwise AND of Numbers Range](LeetCodeNet/G0201_0300/S0201_bitwise_and_of_numbers_range/Solution.cs)| Medium | Bit_Manipulation, Algorithm_II_Day_19_Bit_Manipulation, Top_Interview_150_Bit_Manipulation | 1 | 96.12
17371768
| 0200 |[Number of Islands](LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Top_Interview_150_Graph_General, Big_O_Time_O(M\*N)_Space_O(M\*N) | 131 | 65.99
1769+
| 0199 |[Binary Tree Right Side View](LeetCodeNet/G0101_0200/S0199_binary_tree_right_side_view/Solution.cs)| Medium | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/BFS, Data_Structure_II_Day_16_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_BFS | 0 | 100.00
17381770
| 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, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
1771+
| 0191 |[Number of 1 Bits](LeetCodeNet/G0101_0200/S0191_number_of_1_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation, Algorithm_I_Day_13_Bit_Manipulation, Programming_Skills_I_Day_2_Operator, Udemy_Bit_Manipulation, Top_Interview_150_Bit_Manipulation | 0 | 100.00
17391772
| 0190 |[Reverse Bits](LeetCodeNet/G0101_0200/S0190_reverse_bits/Solution.cs)| Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Bit_Manipulation, Top_Interview_150_Bit_Manipulation | 18 | 93.43
17401773
| 0189 |[Rotate Array](LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
17411774
| 0188 |[Best Time to Buy and Sell Stock IV](LeetCodeNet/G0101_0200/S0188_best_time_to_buy_and_sell_stock_iv/Solution.cs)| Hard | Array, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 1 | 100.00

0 commit comments

Comments
 (0)