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
20150 LLPS binary search bitmasks brute force greedy implementation strings Statement A Codeforces Round 127 (Div. 2) {202} PROGRAMMING 900
1003 Log Stream Analysis binary search brute force implementation strings Statement F CROC-MBTU 2012, Elimination Round (ACM-ICPC) {245} PROGRAMMING КРОК-МВТУ 2012, Отборочный раунд (Разбор) 2000
1028 Hostname Aliases *special binary search data structures implementation sortings strings Statement C CROC 2016 - Qualification {644} PROGRAMMING 2300
5277 Cloud of Hashtags binary search greedy implementation strings Statement D Codeforces Round 401 (Div. 2) {777} PROGRAMMING Problem analysis of Codeforces Round #401 (Div. 2) 1800
12964 Letters Shop binary search implementation strings Statement B Educational Codeforces Round 67 (Rated for Div. 2) {1187} PROGRAMMING Разбор Educational Codeforces Round 67 1300
666 You Are Given Some Letters... binary search implementation math Statement F Educational Codeforces Round 70 (Rated for Div. 2) {1202} PROGRAMMING 68972 2800
8253 Remove the Substring (hard version) binary search greedy implementation two pointers Statement D2 Codeforces Round 579 (Div. 3) {1203} PROGRAMMING Codeforces Round #579 (Div. 3) Editorial 1800
35934 Ternary String binary search dp implementation two pointers Statement B Educational Codeforces Round 87 (Rated for Div. 2) {1354} PROGRAMMING 77593 1200
5006 K-beautiful Strings binary search brute force greedy implementation strings Statement C Codeforces Round 705 (Div. 2) {1493} PROGRAMMING 1750.0 Codeforces Round #705 (Div.2) Editorial
8938 Polycarp and String Transformation binary search implementation sortings strings Statement E Codeforces Round 739 (Div. 3) {1560} PROGRAMMING 94009 1800
5861 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
2972 Chain Queries binary search data structures dfs and similar implementation trees Statement E Codeforces Round 947 (Div. 1 + Div. 2) {1975} PROGRAMMING 2000.0 editorial_zh.pdf 2100
5933 Invertible Bracket Sequences binary search combinatorics data structures divide and conquer implementation two pointers Statement D Educational Codeforces Round 166 (Rated for Div. 2) {1976} PROGRAMMING Educational Codeforces Round 166 Editorial
2310 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
5521 Changing the String binary search data structures greedy implementation sortings strings Statement E Educational Codeforces Round 179 (Rated for Div. 2) {2111} PROGRAMMING Educational Codeforces Round 179 Editorial
6863 Copy String binary search greedy implementation strings Statement D Codeforces Global Round 30 (Div. 1 + Div. 2) {2164} PROGRAMMING 1750.0 Codeforces Global Round 30 Editorial
7686 Rae Taylor and Trees (hard version) binary search constructive algorithms data structures dp dsu implementation trees Statement F Codeforces Round 1065 (Div. 3) {2171} PROGRAMMING Codeforces Round 1065 (Div. 3) Editorial
12434 Rae Taylor and Trees (easy version) binary search data structures dp dsu greedy implementation trees Statement D Codeforces Round 1065 (Div. 3) {2171} PROGRAMMING Codeforces Round 1065 (Div. 3) Editorial
14315 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