Skip to content

Commit

Permalink
Fixed c#
Browse files Browse the repository at this point in the history
  • Loading branch information
@javadev
javadev committed Feb 2, 2024
1 parent 97e841d commit 3e429f3
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions README.md
View file
Original file line number Diff line number Diff line change
Expand Up @@ -742,7 +742,7 @@
| 0234 |[Palindrome Linked List](src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts)| [Java](src/main/java/g0201_0300/s0234_palindrome_linked_list/Solution.java) [Kotlin](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list/Solution.kt) [TypeScript](src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts) [Scala](src/main/scala/g0201_0300/s0234_palindrome_linked_list/Solution.scala) [Ruby](src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb) [PHP](src/main/php/g0201_0300/s0234_palindrome_linked_list/Solution.php) [C#](src/main/csharp/G0201_0300/S0234_palindrome_linked_list/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 96 | 95.67
| 0138 |[Copy List with Random Pointer](src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts)| [Java](src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java) [Kotlin](src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt) [TypeScript](src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts) [Scala](src/main/scala/g0101_0200/s0138_copy_list_with_random_pointer/Solution.scala) [Ruby](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb) [PHP](src/main/php/g0101_0200/s0138_copy_list_with_random_pointer/Solution.php) [C#](src/main/csharp/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) | 52 | 88.27
| 0025 |[Reverse Nodes in k-Group](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts)| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.java) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.kt) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.scala) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.php) [C#](src/main/csharp/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) | 74 | 66.83
| 0146 |[LRU Cache](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts)| [Java](src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts) [Scala](src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache/solution.rb) [PHP](src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php) [C#](src/main/csharp/G0101_0200/S0146_lru_cache/Solution.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) | 473 | 94.72
| 0146 |[LRU Cache](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts)| [Java](src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts) [Scala](src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache/solution.rb) [PHP](src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php) [C#](src/main/csharp/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) | 473 | 94.72

#### Udemy Tree Stack Queue

Expand Down Expand Up @@ -1448,7 +1448,7 @@
| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts)| [Java](src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java) [Kotlin](src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.kt) [TypeScript](src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts) [Scala](src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.scala) [Ruby](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb) [PHP](src/main/php/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.php) [C#](src/main/csharp/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 42 | 98.87
| 0152 |[Maximum Product Subarray](src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts)| [Java](src/main/java/g0101_0200/s0152_maximum_product_subarray/Solution.java) [Kotlin](src/main/kotlin/g0101_0200/s0152_maximum_product_subarray/Solution.kt) [TypeScript](src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts) [Scala](src/main/scala/g0101_0200/s0152_maximum_product_subarray/Solution.scala) [Ruby](src/main/ruby/g0101_0200/s0152_maximum_product_subarray/solution.rb) [PHP](src/main/php/g0101_0200/s0152_maximum_product_subarray/Solution.php) [C#](src/main/csharp/G0101_0200/S0152_maximum_product_subarray/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Dynamic_Programming_I_Day_6, Level_2_Day_13_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 53 | 87.50
| 0148 |[Sort List](src/main/ts/g0101_0200/s0148_sort_list/solution.ts)| [Java](src/main/java/g0101_0200/s0148_sort_list/Solution.java) [Kotlin](src/main/kotlin/g0101_0200/s0148_sort_list/Solution.kt) [TypeScript](src/main/ts/g0101_0200/s0148_sort_list/solution.ts) [Scala](src/main/scala/g0101_0200/s0148_sort_list/Solution.scala) [Ruby](src/main/ruby/g0101_0200/s0148_sort_list/solution.rb) [PHP](src/main/php/g0101_0200/s0148_sort_list/Solution.php) [C#](src/main/csharp/G0101_0200/S0148_sort_list/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Level_2_Day_4_Linked_List, Big_O_Time_O(log(N))_Space_O(log(N)) | 141 | 97.14
| 0146 |[LRU Cache](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts)| [Java](src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts) [Scala](src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache/solution.rb) [PHP](src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php) [C#](src/main/csharp/G0101_0200/S0146_lru_cache/Solution.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 473 | 94.72
| 0146 |[LRU Cache](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts)| [Java](src/main/java/g0101_0200/s0146_lru_cache/LRUCache.java) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache/LRUCache.kt) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache/solution.ts) [Scala](src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache/solution.rb) [PHP](src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php) [C#](src/main/csharp/G0101_0200/S0146_lru_cache/LRUCache.cs)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 473 | 94.72
| 0142 |[Linked List Cycle II](src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts)| [Java](src/main/java/g0101_0200/s0142_linked_list_cycle_ii/Solution.java) [Kotlin](src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii/Solution.kt) [TypeScript](src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts) [Scala](src/main/scala/g0101_0200/s0142_linked_list_cycle_ii/Solution.scala) [Ruby](src/main/ruby/g0101_0200/s0142_linked_list_cycle_ii/solution.rb) [PHP](src/main/php/g0101_0200/s0142_linked_list_cycle_ii/Solution.php) [C#](src/main/csharp/G0101_0200/S0142_linked_list_cycle_ii/Solution.cs)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 59 | 94.39
| 0141 |[Linked List Cycle](src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts)| [Java](src/main/java/g0101_0200/s0141_linked_list_cycle/Solution.java) [Kotlin](src/main/kotlin/g0101_0200/s0141_linked_list_cycle/Solution.kt) [TypeScript](src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts) [Scala](src/main/scala/g0101_0200/s0141_linked_list_cycle/Solution.scala) [Ruby](src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb) [PHP](src/main/php/g0101_0200/s0141_linked_list_cycle/Solution.php) [C#](src/main/csharp/G0101_0200/S0141_linked_list_cycle/Solution.cs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 59 | 93.37
| 0139 |[Word Break](src/main/ts/g0101_0200/s0139_word_break/solution.ts)| [Java](src/main/java/g0101_0200/s0139_word_break/Solution.java) [Kotlin](src/main/kotlin/g0101_0200/s0139_word_break/Solution.kt) [TypeScript](src/main/ts/g0101_0200/s0139_word_break/solution.ts) [Scala](src/main/scala/g0101_0200/s0139_word_break/Solution.scala) [Ruby](src/main/ruby/g0101_0200/s0139_word_break/solution.rb) [PHP](src/main/php/g0101_0200/s0139_word_break/Solution.php) [C#](src/main/csharp/G0101_0200/S0139_word_break/Solution.cs)| 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, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 56 | 88.44
Expand Down

0 comments on commit 3e429f3

Please sign in to comment.