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
1819 Earth Wind and Fire constructive algorithms greedy math sortings two pointers Statement E Codeforces Global Round 3 {1148} PROGRAMMING Codeforces Global Round 3 Editorial 2300
8308 The Party and Sweets binary search constructive algorithms greedy implementation math sortings two pointers Statement A Codeforces Round 559 (Div. 1) {1158} PROGRAMMING 66993 1500
6385 Minimizing Difference binary search constructive algorithms greedy sortings ternary search two pointers Statement E Codeforces Round 592 (Div. 2) {1244} PROGRAMMING Codeforces Round #592 (Div. 2) Tutorial 2000
6362 Multiple Testcases binary search constructive algorithms data structures greedy sortings two pointers Statement D Educational Codeforces Round 86 (Rated for Div. 2) {1342} PROGRAMMING 76633 1900
17367 Sage's Birthday (hard version) binary search constructive algorithms greedy implementation sortings two pointers Statement D2 Codeforces Round 671 (Div. 2) {1419} PROGRAMMING 1000.0 Codeforces Round #671 Editorial
22654 Quality vs Quantity brute force constructive algorithms greedy sortings two pointers Statement B Codeforces Round 774 (Div. 2) {1646} PROGRAMMING 1000.0 Codeforces Round #774 (Div. 2) Editorial 800
5445 Imbalanced Arrays constructive algorithms greedy sortings two pointers Statement B Codeforces Round 887 (Div. 1) {1852} PROGRAMMING 750.0 Codeforces Round 887 (Div 1, Div 2) Tutorial
20201 Smilo and Monsters constructive algorithms greedy sortings two pointers Statement C Codeforces Round 907 (Div. 2) {1891} PROGRAMMING 1000.0
11409 Neutral Tonality constructive algorithms greedy sortings two pointers Statement B Codeforces Round 908 (Div. 1) {1893} PROGRAMMING 1000.0 Codeforces Round 908 (Div. 1, Div, 2) Editorial
5666 Set To Max (Hard Version) binary search constructive algorithms data structures dsu greedy implementation sortings two pointers Statement D2 Codeforces Round 914 (Div. 2) {1904} PROGRAMMING 750.0 Codeforces Round 914 (Div. 2) Editorial
21312 Deque Process constructive algorithms greedy sortings two pointers Statement B Codeforces Round 1039 (Div. 2) {2128} PROGRAMMING 1000.0 Codeforces Round #1039 — Editorial
12409 Loyalty constructive algorithms greedy sortings two pointers Statement C Pinely Round 5 (Div. 1 + Div. 2) {2161} PROGRAMMING 1750.0