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
2170 e-Government data structures dfs and similar dp strings trees Statement E VK Cup 2012 Round 2 {163} PROGRAMMING VK Cup 2012 Round 2 — Разбор 2800
2579 Mike and Friends data structures string suffix structures strings trees Statement E Codeforces Round 305 (Div. 1) {547} PROGRAMMING Codeforces Round #305 Editorial 2800
1212 Ann and Half-Palindrome data structures dp graphs string suffix structures strings trees Statement E Codeforces Round 311 (Div. 2) {557} PROGRAMMING Codeforces Round #311 (Div.2) Editorial 2700
1244 Acyclic Organic Compounds data structures dfs and similar dsu hashing strings trees Statement D Codeforces Round 333 (Div. 1) {601} PROGRAMMING Codeforces Round #333 — editorial 2400
3345 Generating Sets binary search data structures dfs and similar greedy strings trees Statement D Intel Code Challenge Elimination Round (Div. 1 + Div. 2, combined) {722} PROGRAMMING Tutorial 1900
168 Rap God data structures dfs and similar hashing strings trees Statement D Codeforces Round 406 (Div. 1) {786} PROGRAMMING Codeforces Round #406 Editorial 3300
185 Upside Down data structures string suffix structures strings trees Statement E Codeforces Round 459 (Div. 1) {917} PROGRAMMING Codeforces Round #459 Editorial 3000
4714 Perfect Security data structures greedy strings trees Statement C VK Cup 2018 - Round 1 {923} PROGRAMMING VK Cup 2018 Round 1 and CF Round #470 (div. 1 & 2) editorial 1900
1873 Short Code data structures dp greedy strings trees Statement E Codeforces Round 476 (Div. 2) [Thanks, Telegram!] {965} PROGRAMMING Analysis of Codeforces Round #476 (Div. 2) [Thanks, Telegram!] 2500
2172 Kuro and GCD and XOR and SUM binary search bitmasks brute force data structures dp dsu greedy math number theory strings trees Statement D Codeforces Round 482 (Div. 2) {979} PROGRAMMING 1750.0 Codeforces Round #482 (Div. 2) Editorial 2200
210 Moonwalk challenge data structures strings trees Statement J Bubble Cup 11 - Finals [Online Mirror, Div. 1] {1045} PROGRAMMING E 3000
1216 Indie Album data structures dfs and similar hashing string suffix structures strings trees Statement G Educational Codeforces Round 71 (Rated for Div. 2) {1207} PROGRAMMING Educational Codeforces Round 71 Editorial 2600
1362 Koala and Notebook data structures dfs and similar graphs shortest paths strings trees Statement F Codeforces Round 584 - Dasha Code Championship - Elimination Round (rated, open for everyone, Div. 1 + Div. 2) {1209} PROGRAMMING 69791 2600
410 Find String in a Grid data structures dp strings trees Statement D 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) {1252} PROGRAMMING T 2900
5031 XOR Inverse bitmasks data structures divide and conquer greedy strings trees Statement C Codeforces Round 673 (Div. 1) {1416} PROGRAMMING 1250.0 Codeforces Round #673 Editorial 2000
1249 Death DBMS data structures hashing string suffix structures strings trees Statement G Educational Codeforces Round 97 (Rated for Div. 2) {1437} PROGRAMMING 84149
243 Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees Statement G Codeforces Round 758 (Div.1 + Div. 2) {1608} PROGRAMMING 2750.0 Editorial of Codeforces Round #758 (Div.1 + Div. 2)
1255 Middle Duplication data structures dfs and similar greedy strings trees Statement E Codeforces Round 763 (Div. 2) {1623} PROGRAMMING 2750.0 Codeforces Round #763 (Div. 2) Editorial
2185 Xor-Subsequence (hard version) bitmasks data structures dp strings trees Statement D2 Codeforces Round 815 (Div. 2) {1720} PROGRAMMING 1000.0 Codeforces Round #815 (Div. 2) Editorial
2546 Prefix Function Queries bitmasks brute force data structures hashing string suffix structures strings trees Statement E Educational Codeforces Round 134 (Rated for Div. 2) {1721} PROGRAMMING 106416
1521 Hossam and Range Minimum Query binary search bitmasks data structures hashing probabilities strings trees Statement F Codeforces Round 837 (Div. 2) {1771} PROGRAMMING 3500.0 Codeforces Round #837 (Div. 2) Editorial
1335 Comfortably Numb binary search bitmasks data structures divide and conquer dsu strings trees two pointers Statement F Codeforces Round 845 (Div. 2) and ByteRace 2023 {1777} PROGRAMMING 2750.0 Codeforces Round #845 (Div. 2) and ByteRace 2023 Editorial
7374 Lisa and the Martians bitmasks data structures greedy math sortings strings trees Statement F Codeforces Round 888 (Div. 3) {1851} PROGRAMMING 118667
12287 Queries for the Array data structures dfs and similar implementation strings trees Statement C Educational Codeforces Round 154 (Rated for Div. 2) {1861} PROGRAMMING Educational Codeforces Round 154 Editorial
3036 Guess Game bitmasks combinatorics constructive algorithms data structures games math probabilities strings trees Statement E Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) {1864} PROGRAMMING 2000.0 Harbour.Space Scholarship Contest 2023-2024 (Div. 1 + Div. 2) Editorial
5569 Collapsing Strings binary search data structures dfs and similar hashing strings trees Statement E Educational Codeforces Round 159 (Rated for Div. 2) {1902} PROGRAMMING Educational Codeforces Round 159 Editorial
1691 Yasya and the Mysterious Tree bitmasks data structures dfs and similar graphs strings trees Statement G Codeforces Round 950 (Div. 3) {1980} PROGRAMMING 130135
672 Auto Complete data structures implementation sortings strings trees Statement I 2024 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) {2041} PROGRAMMING Problem Analysis and Hints (PDF)
3772 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