| 186 |
Implement Stack ADT by Linked List |
100
/
135
|
| 187 |
Implement Deque ADT |
94
/
241
|
| 188 |
Minimum Value in a Sliding Window (Bonus) |
63
/
151
|
| 189 |
Rotated Palindrome Linked List 2025 (Required) |
59
/
290
|
| 190 |
Largest Rectangle in Histogram 2025(Required) |
65
/
126
|
| 191 |
Doubly Linked List Rotation 2025 (Optional) |
4
/
17
|
| 192 |
Extra Bracket 2025 (Optional) |
5
/
13
|
| 193 |
Balanced Binary Search Tree 2025 (Required) |
72
/
86
|
| 194 |
Sliding Window Maximum by Heap Sorting 2025 (Required) |
68
/
87
|
| 195 |
Merge Sort Into A Single Array In Non-Increasing Order 2025 (Optional) |
5
/
23
|
| 196 |
Array Sum Problem By Merge Sort 2025 (Optional) |
5
/
5
|
| 197 |
Post-order Calculation |
85
/
340
|
| 198 |
Heap Sort |
97
/
255
|
| 199 |
Basic Operations in Binary Search Tree |
82
/
352
|
| 200 |
Maintaining a Set with AVL-Tree |
59
/
368
|
| 201 |
Unordered Map via Double Hashing |
23
/
45
|
| 202 |
Cycle Detection |
20
/
43
|
| 203 |
Graph ADT and BFS |
23
/
80
|
| 204 |
Minimum Cost for Transportation Design |
11
/
28
|