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 |
|---|---|---|---|---|---|---|---|---|---|
| 1564 | Tree-String Problem | *special dfs and similar hashing strings | Statement | E | Croc Champ 2013 - Qualification Round {291} | PROGRAMMING | 2400 | ||
| 514 | String Searching | *special hashing | Statement | D | Kotlin Heroes: Episode 7 {1533} | PROGRAMMING | Kotlin Heroes 7 — Editorial |