| 186 |
Implement Stack ADT by Linked List |
102
/
137
|
| 187 |
Implement Deque ADT |
96
/
243
|
| 188 |
Minimum Value in a Sliding Window (Bonus) |
65
/
153
|
| 189 |
Rotated Palindrome Linked List 2025 (Required) |
61
/
294
|
| 190 |
Largest Rectangle in Histogram 2025(Required) |
68
/
129
|
| 191 |
Doubly Linked List Rotation 2025 (Optional) |
5
/
24
|
| 192 |
Extra Bracket 2025 (Optional) |
7
/
15
|
| 193 |
Balanced Binary Search Tree 2025 (Required) |
74
/
88
|
| 194 |
Sliding Window Maximum by Heap Sorting 2025 (Required) |
69
/
88
|
| 195 |
Merge Sort Into A Single Array In Non-Increasing Order 2025 (Optional) |
6
/
24
|
| 196 |
Array Sum Problem By Merge Sort 2025 (Optional) |
6
/
8
|
| 197 |
Post-order Calculation |
86
/
341
|
| 198 |
Heap Sort |
98
/
256
|
| 199 |
Basic Operations in Binary Search Tree |
83
/
356
|
| 200 |
Maintaining a Set with AVL-Tree |
60
/
375
|
| 201 |
Unordered Map via Double Hashing |
97
/
172
|
| 202 |
Cycle Detection |
90
/
173
|
| 203 |
Graph ADT and BFS |
89
/
250
|
| 204 |
Minimum Cost for Transportation Design |
70
/
142
|
| 205 |
Nearest Neighbor Search |
164
/
361
|