Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 3993 | Range Sorting (Easy Version) | binary search dp ds greedy trees two pointers | Statement | B1 | Codeforces Round 873 (Div. 1) {1827} | PROGRAMMING | 750.0 | Codeforces Round #873 (Div. 1 & 2) Editorial | 2000 |