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
4704 Array Partition binary search brute force data structures greedy two pointers Statement F Codeforces Round 686 (Div. 3) {1454} PROGRAMMING Codeforces Round #686 (Div. 3) Editorial
3218 Trees and Segments binary search brute force constructive algorithms data structures dp greedy two pointers Statement D Codeforces Round 893 (Div. 2) {1858} PROGRAMMING 2000.0 Codeforces Round #893 (Div. 2) Editorial 2200
34323 Find the Different Ones! binary search brute force data structures dp greedy two pointers Statement D Codeforces Round 923 (Div. 3) {1927} PROGRAMMING 125597
1197 Orangutan Approved Subarrays binary search brute force data structures greedy two pointers Statement F Codeforces Round 979 (Div. 2) {2030} PROGRAMMING 2500.0 Codeforces Round 979 Editorial
5875 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
2291 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
3888 Shorten the Array binary search brute force data structures dfs and similar greedy strings trees two pointers Statement G Codeforces Round 1016 (Div. 3) {2093} PROGRAMMING Codeforces Round 1016 (Div. 3) Editorial
12728 Palindromex binary search brute force constructive algorithms data structures greedy implementation two pointers Statement D Codeforces Round 1096 (Div. 3) {2227} PROGRAMMING Codeforces Round 1096 (Div. 3) — Editorial