### Day 1 and 2 ↵
↵
#### Dynamic Programming↵
- Two good blog entries for dp — [Basic](http://codeforces.net/blog/entry/43256) , [Good Tricks](http://codeforces.net/blog/entry/47764)↵
- [Modified Knapsack — 1](http://codeforces.net/problemset/problem/742/D)↵
- [Maximum Disjoint Subtrees Sum](http://codeforces.net/problemset/problem/743/D)↵
- [Modified Knapsack — 2](http://codeforces.net/problemset/problem/755/F)↵
- [State-Space Reduction](http://codeforces.net/contest/505/problem/C)↵
- [Chess Board Dp](http://codeforces.net/contest/559/problem/C)↵
↵
#### Segment Trees↵
- A nice blog entry for this [Everything About Segment Trees](http://codeforces.net/blog/entry/15890),contains many good problems to try as well↵
- [Stack-SegTree problem](http://codeforces.net/problemset/problem/756/C)↵
- [Matrix Expo on SegTree](http://codeforces.net/problemset/problem/718/C)↵
- [Implementation-Hackerearth](https://www.hackerearth.com/practice/notes/segment-tree-and-lazy-propagation/)↵
↵
#### Tries↵
- Topcoder tutorial is pretty good to get an understanding , [Tries](https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/)↵
- Try to make your own implementation and code up the problems in , [BIT-Tries](https://threads-iiith.quora.com/Tutorial-on-Trie-and-example-problems)↵
- [Watto and Mechanism](http://codeforces.net/problemset/problem/514/C)↵
- [Good Substrings](http://codeforces.net/problemset/problem/271/D)↵
↵
#### Mo's Algorithm & SQRT decomposition↵
- [Blog](https://blog.anudeep2011.com/mos-algorithm/) , an entry by anudeep nekkanti which is really good.It has good problems at the end of it.↵
- [Easy-Medium on Mo's](http://codeforces.net/contest/220/problem/B)↵
- [Medium-Hard](http://codeforces.net/contest/13/problem/E)↵
- [Medium-Hard](http://codeforces.net/contest/455/problem/D)↵
- [Mo's Algorithm on Trees](http://codeforces.net/blog/entry/43230)↵
↵
Please leave a comment with other good problems or blog entries that you find. Will help make the blog better.
↵
#### Dynamic Programming↵
- Two good blog entries for dp — [Basic](http://codeforces.net/blog/entry/43256) , [Good Tricks](http://codeforces.net/blog/entry/47764)↵
- [Modified Knapsack — 1](http://codeforces.net/problemset/problem/742/D)↵
- [Maximum Disjoint Subtrees Sum](http://codeforces.net/problemset/problem/743/D)↵
- [Modified Knapsack — 2](http://codeforces.net/problemset/problem/755/F)↵
- [State-Space Reduction](http://codeforces.net/contest/505/problem/C)↵
- [Chess Board Dp](http://codeforces.net/contest/559/problem/C)↵
↵
#### Segment Trees↵
- A nice blog entry for this [Everything About Segment Trees](http://codeforces.net/blog/entry/15890),contains many good problems to try as well↵
- [Stack-SegTree problem](http://codeforces.net/problemset/problem/756/C)↵
- [Matrix Expo on SegTree](http://codeforces.net/problemset/problem/718/C)↵
- [Implementation-Hackerearth](https://www.hackerearth.com/practice/notes/segment-tree-and-lazy-propagation/)↵
↵
#### Tries↵
- Topcoder tutorial is pretty good to get an understanding , [Tries](https://www.topcoder.com/community/data-science/data-science-tutorials/using-tries/)↵
- Try to make your own implementation and code up the problems in , [BIT-Tries](https://threads-iiith.quora.com/Tutorial-on-Trie-and-example-problems)↵
- [Watto and Mechanism](http://codeforces.net/problemset/problem/514/C)↵
- [Good Substrings](http://codeforces.net/problemset/problem/271/D)↵
↵
#### Mo's Algorithm & SQRT decomposition↵
- [Blog](https://blog.anudeep2011.com/mos-algorithm/) , an entry by anudeep nekkanti which is really good.It has good problems at the end of it.↵
- [Easy-Medium on Mo's](http://codeforces.net/contest/220/problem/B)↵
- [Medium-Hard](http://codeforces.net/contest/13/problem/E)↵
- [Medium-Hard](http://codeforces.net/contest/455/problem/D)↵
- [Mo's Algorithm on Trees](http://codeforces.net/blog/entry/43230)↵
↵
Please leave a comment with other good problems or blog entries that you find. Will help make the blog better.
