Review the problem statement from Codeforces (link will open a new tab). When you've matched your problem, go to the solutions.
Get exact match for tags using this format, eg: [u'brute force', 'dp']
Solved |
Name |
Tags |
Solutions |
Index |
Contest |
Type |
Points |
Tutorial |
Rating Level |
|---|---|---|---|---|---|---|---|---|---|
| 6627 | String Reversal | data structures greedy strings | Statement | E | Educational Codeforces Round 96 (Rated for Div. 2) {1430} | PROGRAMMING | Educational Codeforces Round 96 — Editorial | ||
| 2529 | Lexicographically Small Enough | data structures greedy strings | Statement | E | Good Bye 2021: 2022 is NEAR {1616} | PROGRAMMING | 2500.0 | Good Bye 2021 -- Editorial | 2200 |
| 24774 | Remove Two Letters | data structures greedy hashing strings | Statement | D | Codeforces Round 855 (Div. 3) {1800} | PROGRAMMING | Codeforces Round 855 (Div. 3) Editorial | ||
| 2370 | Sofia and Strings | data structures greedy strings | Statement | E | Codeforces Round 910 (Div. 2) {1898} | PROGRAMMING | 2000.0 | Editorial for Codeforces Round #910 (Div. 2) | |
| 12767 | Largest Subsequence | data structures greedy strings | Statement | C | Codeforces Round 915 (Div. 2) {1905} | PROGRAMMING | 1500.0 | Codeforces Round 915 (Div. 2) Editorial |