Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Search on plain tags, ratings, names, and problem text. Example: brute force or binary search
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 17718 | Lex String | brute force greedy implementation sortings two pointers | Statement | A | Codeforces Round 798 (Div. 2) {1689} | PROGRAMMING | 500.0 | Editorial for Codeforces Round #798 (Div. 2) |