Skip to content

Commit 3f28b22

Browse files
javadevjavadev
authored
Updated readme
1 parent 6df0397 commit 3f28b22

File tree

1 file changed

+13
-0
lines changed

1 file changed

+13
-0
lines changed

‎README.md‎

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

514514
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
515515
|-|-|-|-|-|-
516+
| 0100 |[Same Tree](LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
516517
| 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
517518

518519
#### Day 16 Design
@@ -646,6 +647,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
646647
| 0094 |[Binary Tree Inorder Traversal](LeetCodeNet/G0001_0100/S0094_binary_tree_inorder_traversal/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
647648
| 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
648649
| 0543 |[Diameter of Binary Tree](LeetCodeNet/G0501_0600/S0543_diameter_of_binary_tree/Solution.cs)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
650+
| 0100 |[Same Tree](LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
649651
| 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, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
650652
| 0104 |[Maximum Depth of Binary Tree](LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
651653
| 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, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
@@ -706,6 +708,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
706708

707709
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
708710
|-|-|-|-|-|-
711+
| 0088 |[Merge Sorted Array](LeetCodeNet/G0001_0100/S0088_merge_sorted_array/Solution.cs)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 0 | 100.00
709712
| 0027 |[Remove Element](LeetCodeNet/G0001_0100/S0027_remove_element/Solution.cs)| Easy | Array, Two_Pointers | 0 | 100.00
710713
| 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
711714
| 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
@@ -779,17 +782,20 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
779782
| 0002 |[Add Two Numbers](LeetCodeNet/G0001_0100/S0002_add_two_numbers/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 91.39
780783
| 0021 |[Merge Two Sorted Lists](LeetCodeNet/G0001_0100/S0021_merge_two_sorted_lists/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00
781784
| 0138 |[Copy List with Random Pointer](LeetCodeNet/G0101_0200/S0138_copy_list_with_random_pointer/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 77 | 48.03
785+
| 0092 |[Reverse Linked List II](LeetCodeNet/G0001_0100/S0092_reverse_linked_list_ii/Solution.cs)| Medium | Linked_List | 0 | 100.00
782786
| 0025 |[Reverse Nodes in k-Group](LeetCodeNet/G0001_0100/S0025_reverse_nodes_in_k_group/Solution.cs)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00
783787
| 0019 |[Remove Nth Node From End of List](LeetCodeNet/G0001_0100/S0019_remove_nth_node_from_end_of_list/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
784788
| 0082 |[Remove Duplicates from Sorted List II](LeetCodeNet/G0001_0100/S0082_remove_duplicates_from_sorted_list_ii/Solution.cs)| Medium | Two_Pointers, Linked_List | 0 | 100.00
785789
| 0061 |[Rotate List](LeetCodeNet/G0001_0100/S0061_rotate_list/Solution.cs)| Medium | Two_Pointers, Linked_List | 0 | 100.00
790+
| 0086 |[Partition List](LeetCodeNet/G0001_0100/S0086_partition_list/Solution.cs)| Medium | Two_Pointers, Linked_List | 0 | 100.00
786791
| 0146 |[LRU Cache](LeetCodeNet/G0101_0200/S0146_lru_cache/LRUCache.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 28 | 80.36
787792

788793
#### Top Interview 150 Binary Tree General
789794

790795
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
791796
|-|-|-|-|-|-
792797
| 0104 |[Maximum Depth of Binary Tree](LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
798+
| 0100 |[Same Tree](LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 0 | 100.00
793799
| 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, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
794800
| 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
795801
| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](LeetCodeNet/G0101_0200/S0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 1 | 96.98
@@ -904,6 +910,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
904910
| 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
905911
| 0063 |[Unique Paths II](LeetCodeNet/G0001_0100/S0063_unique_paths_ii/Solution.cs)| Medium | Array, Dynamic_Programming, Matrix | 0 | 100.00
906912
| 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
913+
| 0097 |[Interleaving String](LeetCodeNet/G0001_0100/S0097_interleaving_string/Solution.cs)| Medium | String, Dynamic_Programming | 56 | 87.55
907914
| 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
908915
| 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
909916

@@ -920,6 +927,7 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
920927
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
921928
|-|-|-|-|-|-
922929
| 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
930+
| 0088 |[Merge Sorted Array](LeetCodeNet/G0001_0100/S0088_merge_sorted_array/Solution.cs)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 0 | 100.00
923931

924932
#### Day 3 Array
925933

@@ -1696,9 +1704,14 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
16961704
| 0104 |[Maximum Depth of Binary Tree](LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
16971705
| 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, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
16981706
| 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, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
1707+
| 0100 |[Same Tree](LeetCodeNet/G0001_0100/S0100_same_tree/Solution.cs)| Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Level_2_Day_15_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General | 0 | 100.00
16991708
| 0098 |[Validate Binary Search Tree](LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs)| 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, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
1709+
| 0097 |[Interleaving String](LeetCodeNet/G0001_0100/S0097_interleaving_string/Solution.cs)| Medium | String, Dynamic_Programming, Top_Interview_150_Multidimensional_DP | 56 | 87.55
17001710
| 0096 |[Unique Binary Search Trees](LeetCodeNet/G0001_0100/S0096_unique_binary_search_trees/Solution.cs)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
17011711
| 0094 |[Binary Tree Inorder Traversal](LeetCodeNet/G0001_0100/S0094_binary_tree_inorder_traversal/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Data_Structure_I_Day_10_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
1712+
| 0092 |[Reverse Linked List II](LeetCodeNet/G0001_0100/S0092_reverse_linked_list_ii/Solution.cs)| Medium | Linked_List, Top_Interview_150_Linked_List | 0 | 100.00
1713+
| 0088 |[Merge Sorted Array](LeetCodeNet/G0001_0100/S0088_merge_sorted_array/Solution.cs)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_I_Day_2_Array, Top_Interview_150_Array/String | 0 | 100.00
1714+
| 0086 |[Partition List](LeetCodeNet/G0001_0100/S0086_partition_list/Solution.cs)| Medium | Two_Pointers, Linked_List, Top_Interview_150_Linked_List | 0 | 100.00
17021715
| 0084 |[Largest Rectangle in Histogram](LeetCodeNet/G0001_0100/S0084_largest_rectangle_in_histogram/Solution.cs)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n_log_n)_Space_O(log_n) | 5 | 100.00
17031716
| 0082 |[Remove Duplicates from Sorted List II](LeetCodeNet/G0001_0100/S0082_remove_duplicates_from_sorted_list_ii/Solution.cs)| Medium | Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Algorithm_II_Day_3_Two_Pointers, Top_Interview_150_Linked_List | 0 | 100.00
17041717
| 0080 |[Remove Duplicates from Sorted Array II](LeetCodeNet/G0001_0100/S0080_remove_duplicates_from_sorted_array_ii/Solution.cs)| Medium | Array, Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String | 125 | 97.82

0 commit comments

Comments
 (0)