Refer to Sahil Bansal's repo for finding the original checklist.
- Read Dynamic Programming Notes Hackerearth
- Read DP Tutorial involving grids
- Read TopCoder Tutorial on DP
- Solve the following classical problems:
- Solve the following MISC problems:
- Try to solve as much tasks as possible in this Educational DP contest on AtCoder
- Basics of String manipulation
- KMP algorithm
- Z algorithm
- Manachar's algorithm
- Rabin-Karp and KMP TopCoder
| ☆ | Problem Link | Finished |
|---|---|---|
| ★★☆ | Find the substrings | |
| ★★☆ | The Cheapest Palindrome | |
| ★★☆ | Largest Lexicographical Rotation II | |
| ★★☆ | Monk and Monster | |
| ★★★ | Prefix Number | |
| ★★★ | Last Forever |
| ☆ | Problem Link | Finished |
|---|---|---|
| ★☆☆ | Sherlock and the Valid String | |
| ★☆☆ | Highest Value Palindrome | |
| ★★☆ | Sherlock and Anagrams | |
| ★★☆ | Common Child | |
| ★★★ | Build a Palindrome |
| ☆ | Problem Link | Finished |
|---|---|---|
| ★☆☆ | Petya and Exam | |
| ★★☆ | Password | |
| ★★★ | Prefixes and Suffixes |
- Solve the remaining problems from Week 1 and Week 2.
- Take part in CodeChef June Challenge.
This list will be updated frequently.
- Tutorial 1: Base Concept + Mo's algorithm
- Tutorial 2
- Tutorial 3 : Read the comments
- Tutorial 4 : Video Lecture, find slides in video description
- Tutorial 5 : Exhaustive PDF
- Tutorial 6 : Mo's Algorithm