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 |
---|---|---|---|---|---|---|---|---|---|
2178 | Om Nom and Necklace | hashing string suffix structures strings | Statement | D | ZeptoLab Code Rush 2015 {526} | PROGRAMMING | 2200 | ||
906 | Encoding | hashing string suffix structures strings | Statement | F | VK Cup 2015 - Round 2 (unofficial online mirror, Div. 1 only) {533} | PROGRAMMING | Разбор VK Cup Round 2 | 2400 | |
2067 | Frequency of String | hashing string suffix structures strings | Statement | D | Tinkoff Internship Warmup Round 2018 and Codeforces Round 475 (Div. 1) {963} | PROGRAMMING | Editorial Tinkoff Internship Warmup Round 2018 and Codeforces Round #475 (Div. 1 + Div. 2) | 2400 | |
12164 | Prefix-Suffix Palindrome (Easy version) | hashing string suffix structures strings | Statement | D1 | Codeforces Global Round 7 {1326} | PROGRAMMING | 1000.0 | 74961 | 1500 |