| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 144 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
|
On
dorjderem →
Anyone who comments under this post has to reach CM by September if can't...., 2 years ago
0
Ready to touch grass |
|
On
stark_happy →
Can someone PLEASE help me out for upskilling myself iafter these contests ?, 2 years ago
0
I would suggest you to do neetcode 150.Although it might not be directly related to cp but it gives a good insight to commonly used data structures and algorithms. I am no expert in cp though, i started a like a month ago so i might be completely wrong. |
|
0
This was a question in the endsem exam of discrete structures course i did a year ago. Still dont know how to solve it :( |
|
0
Auto comment: topic has been updated by cesiumstar (previous revision, new revision, compare). |
|
0
I know about stack,queue and dequeue as well. Forgot to mention that. My fault :( I dont know about segment trees though. |
|
0
Thanks |
|
0
Hey i am new to this platform. Is this contest rated? |
| Name |
|---|


