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 |
|---|---|---|---|---|---|---|---|---|---|
| 861 | DZY Loves Strings | binary search hashing strings two pointers | Statement | D | Codeforces Round 254 (Div. 1) {444} | PROGRAMMING | Codeforces Round #254 Editorial | 2400 | |
| 2985 | Two strings | binary search hashing strings two pointers | Statement | C | Educational Codeforces Round 17 {762} | PROGRAMMING | Tutorial | 2100 | |
| 7002 | Palindrome Shuffle | binary search greedy hashing strings two pointers | Statement | D | Educational Codeforces Round 174 (Rated for Div. 2) {2069} | PROGRAMMING | 139774 |