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 |
|---|---|---|---|---|---|---|---|---|---|
| 70 | Build From Suffixes | *special combinatorics data structures | Statement | H | Kotlin Heroes: Episode 6 {1488} | PROGRAMMING | 88522 | ||
| 13800 | Piecing It Together | *special string suffix structures | Statement | A | April Fools Day Contest 2025 {2095} | PROGRAMMING |