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 |
|---|---|---|---|---|---|---|---|---|---|
| 787 | Hidden Bipartite Graph | binary search constructive algorithms dfs and similar graphs interactive | Statement | E | Lyft Level 5 Challenge 2018 - Elimination Round {1033} | PROGRAMMING | The Lyft Level 5 Challenge 2018 Elimination Round (Div. 1 + Div. 2) Editorial | 2700 |