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 |
|---|---|---|---|---|---|---|---|---|---|
| 11820 | Prefixes and Suffixes | dp string suffix structures strings two pointers | Statement | D | Codeforces Round 246 (Div. 2) {432} | PROGRAMMING | Codeforces Round #246 (Div. 2) Editorial | 2000 |