| 206 |
Matrix Multiplication |
147
/
220
|
| 207 |
Magic Array |
145
/
245
|
| 208 |
Make the Array Great (Bonus) |
105
/
629
|
| 209 |
Implement Stack ADT by Linked List |
152
/
335
|
| 210 |
Implement a Queue ADT by Linked List |
142
/
364
|
| 211 |
Rainwater |
142
/
233
|
| 212 |
Largest Rectangle of 1s in Binary Matrix (Bonus) |
115
/
213
|
| 213 |
Binary Tree Traversals |
144
/
207
|
| 214 |
Merging Ore Piles |
136
/
400
|
| 215 |
Maintaining a Set with Binary Search Tree |
141
/
186
|
| 216 |
Maintaining a Key-Value Map with AVL-Tree (Bonus) |
119
/
170
|
| 217 |
Value Computation |
45
/
94
|
| 218 |
Counting Values by Double Hashing |
42
/
122
|
| 219 |
Graph ADT and DFS |
36
/
185
|
| 220 |
Minimum Length with Constraints (Bonus) |
38
/
63
|