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 |
|---|---|---|---|---|---|---|---|---|---|
| 916 | Tricky and Clever Password | binary search constructive algorithms data structures greedy hashing strings | Statement | E | Codeforces Beta Round 30 (Codeforces format) {30} | PROGRAMMING | Codeforces Beta Round #30. Tutorial for problem A | 2700 | |
| 24623 | Password | binary search dp hashing string suffix structures strings | Statement | B | Codeforces Beta Round 93 (Div. 1 Only) {126} | PROGRAMMING | Tutorial | 1800 | |
| 1059 | Misha and LCP on Tree | binary search dfs and similar hashing string suffix structures trees | Statement | E | Codeforces Round 285 (Div. 1) {504} | PROGRAMMING | 15743 | 3000 | |
| 8082 | Watto and Mechanism | binary search data structures hashing string suffix structures strings | Statement | C | Codeforces Round 291 (Div. 2) {514} | PROGRAMMING | Codeforces Round #291 (Div. 2) Editorial | 1900 | |
| 1059 | Liar | binary search dp hashing string suffix structures | Statement | E | Codeforces Round 422 (Div. 2) {822} | PROGRAMMING | Codeforces Round #422 (Div. 2) Editorial | 2500 | |
| 944 | k-substrings | binary search hashing string suffix structures | Statement | F | Educational Codeforces Round 41 (Rated for Div. 2) {961} | PROGRAMMING | Educational Codeforces Round 41 Editorial | 2700 | |
| 1000 | Morse Code | binary search data structures dp hashing sortings string suffix structures strings | Statement | C | Codeforces Round 542 [Alex Lopashev Thanks-Round] (Div. 1) {1129} | PROGRAMMING | 65520 | 2300 | |
| 605 | String Distance | binary search data structures hashing string suffix structures strings | Statement | F | Educational Codeforces Round 110 (Rated for Div. 2) {1535} | PROGRAMMING | 91481 | ||
| 16236 | Erase and Extend (Easy Version) | binary search brute force dp greedy hashing string suffix structures strings | Statement | E1 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1250.0 | Codeforces Round #726 (Div.2) Editorial | |
| 6133 | Erase and Extend (Hard Version) | binary search data structures greedy hashing string suffix structures strings | Statement | E2 | Codeforces Round 726 (Div. 2) {1537} | PROGRAMMING | 1750.0 | Codeforces Round #726 (Div.2) Editorial | |
| 243 | Alphabetic Tree | binary search data structures dfs and similar hashing string suffix structures strings trees | Statement | G | Codeforces Round 758 (Div.1 + Div. 2) {1608} | PROGRAMMING | 2750.0 | Editorial of Codeforces Round #758 (Div.1 + Div. 2) | |
| 5268 | Division + LCP (easy version) | binary search data structures dp hashing string suffix structures strings | Statement | G1 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 1900 | |
| 2494 | Division + LCP (hard version) | binary search brute force data structures dp hashing math string suffix structures strings | Statement | G2 | Codeforces Round 943 (Div. 3) {1968} | PROGRAMMING | 129096 | 2200 |