| 186 |
Implement Stack ADT by Linked List |
104
/
139
|
| 187 |
Implement Deque ADT |
98
/
245
|
| 188 |
Minimum Value in a Sliding Window (Bonus) |
67
/
155
|
| 189 |
Rotated Palindrome Linked List 2025 (Required) |
63
/
296
|
| 190 |
Largest Rectangle in Histogram 2025(Required) |
70
/
131
|
| 191 |
Doubly Linked List Rotation 2025 (Optional) |
8
/
36
|
| 192 |
Extra Bracket 2025 (Optional) |
9
/
17
|
| 193 |
Balanced Binary Search Tree 2025 (Required) |
76
/
90
|
| 194 |
Sliding Window Maximum by Heap Sorting 2025 (Required) |
71
/
90
|
| 195 |
Merge Sort Into A Single Array In Non-Increasing Order 2025 (Optional) |
8
/
26
|
| 196 |
Array Sum Problem By Merge Sort 2025 (Optional) |
8
/
10
|
| 197 |
Post-order Calculation |
88
/
344
|
| 198 |
Heap Sort |
100
/
258
|
| 199 |
Basic Operations in Binary Search Tree |
85
/
358
|
| 200 |
Maintaining a Set with AVL-Tree |
62
/
377
|
| 201 |
Unordered Map via Double Hashing |
99
/
174
|
| 202 |
Cycle Detection |
92
/
175
|
| 203 |
Graph ADT and BFS |
91
/
252
|
| 204 |
Minimum Cost for Transportation Design |
72
/
144
|
| 205 |
Nearest Neighbor Search |
166
/
363
|