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
4396 White Lines brute force data structures dp implementation two pointers Statement D Codeforces Round 578 (Div. 2) {1200} PROGRAMMING Codeforces Round #578 (Div. 2) Editorial 1900
29358 New Theatre Square brute force dp greedy implementation two pointers Statement B Educational Codeforces Round 88 (Rated for Div. 2) {1359} PROGRAMMING Educational Codeforces Round 88 Editorial 1000
4616 Two Arrays binary search brute force combinatorics dp greedy implementation two pointers Statement E Educational Codeforces Round 89 (Rated for Div. 2) {1366} PROGRAMMING Educational Codeforces Round 89 Editorial
20523 Good String brute force dp greedy implementation two pointers Statement C Educational Codeforces Round 92 (Rated for Div. 2) {1389} PROGRAMMING 80809
17530 Maximum Sum of Products brute force dp implementation math ternary search two pointers Statement D Educational Codeforces Round 108 (Rated for Div. 2) {1519} PROGRAMMING Educational Codeforces Round 108 Editorial
795 Hossam and a Letter brute force dp implementation two pointers Statement E Codeforces Round 837 (Div. 2) {1771} PROGRAMMING 2750.0 Codeforces Round #837 (Div. 2) Editorial
5809 Yet Another Real Number Problem binary search brute force data structures dp greedy implementation math two pointers Statement D Codeforces Global Round 27 {2035} PROGRAMMING 1500.0 Codeforces Global Round 27 Editorial
2259 Kevin and Binary String (Easy Version) binary search brute force data structures dp greedy implementation strings two pointers Statement F1 IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) {2061} PROGRAMMING 2000.0 IAEPC Preliminary Contest (Codeforces Round 999, Div. 1 + Div. 2) Editorial