Codeforces problemset search & solutions
Exclude tags.

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
24623 Password binary search dp hashing string suffix structures strings Statement B Codeforces Beta Round 93 (Div. 1 Only) {126} PROGRAMMING Tutorial 1800
488 Xenia and String Problem dp hashing implementation string suffix structures strings Statement E Codeforces Round 207 (Div. 1) {356} PROGRAMMING 9210 2800
3349 Spy Syndrome 2 data structures dp hashing implementation sortings string suffix structures strings Statement C Manthan, Codefest 16 {633} PROGRAMMING Manthan, Codefest 16: Editorials 1900
1941 String Compression dp hashing string suffix structures strings Statement F Educational Codeforces Round 25 {825} PROGRAMMING Educational Codeforces Round 25 - Editorial 2400
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
446 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings Statement E1 Codeforces Round 662 (Div. 2) {1393} PROGRAMMING 1500.0 Codeforces Round #662 Editorial
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
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