This Blog is Just the List of Problems for Dynamic Programming Optimizations.Before start read [This](http://codeforces.me/blog/entry/8219) blog.↵
↵
#### **1.Knuth Optimization**↵
↵
Read [This](https://www.quora.com/What-is-Knuths-optimization-in-dynamic-programming) article before solving Knuth optimization problems.↵
↵
[Problem 1](https://uva.onlinejudge.org/external/100/10003.pdf)↵
[Problem 2](https://uva.onlinejudge.org/external/103/10304.pdf)↵
[Problem 3](http://codeforces.me/gym/100212/attachments/download/1727/20042005-winter-petrozavodsk-camp-andrew-stankevich-contest-10-en.pdf) ( **C** )↵
[Problem 4](http://www.spoj.com/problems/BRKSTRNG/)↵
[Problem 5](https://uva.onlinejudge.org/external/120/12057.pdf)↵
[Problem 6](https://uva.onlinejudge.org/external/128/12836.pdf)↵
↵
#### **2. Divide and Conquer Optimization**↵
↵
Read [This](https://www.quora.com/What-is-divide-and-conquer-optimization-in-dynamic-programming) article before solving Divide and Conquer Optimization problems↵
↵
[Problem 1](https://www.codechef.com/problems/CHEFAOR)↵
[Problem 2](http://www.spoj.com/problems/NKLEAVES/)↵
[Problem 3](https://www.hackerrank.com/contests/ioi-2014-practice-contest-2/challenges/guardians-lunatics-ioi14)↵
[Problem 4](https://www.hackerrank.com/contests/world-codesprint-5/challenges/mining)↵
[Problem 5](http://codeforces.me/contest/321/problem/E)↵
[Problem 6](http://acm.timus.ru/problem.aspx?space=1&num=1167)↵
[Problem 7](https://uva.onlinejudge.org/external/125/12524.pdf)↵
[Problem 8](http://codeforces.me/problemset/problem/673/E)↵
[Problem 9](https://arc067.contest.atcoder.jp/tasks/arc067_d)↵
[Problem 10](http://codeforces.me/problemset/problem/834/D)↵
[Problem 11](http://poj.org/problem?id=1741)↵
↵
#### **3. Convex Hull Trick Technique(CHT)**↵
↵
Read [This](http://wcipeg.com/wiki/Convex_hull_trick) article before solving problem based on CHT.↵
↵
[Problem 1](http://www.spoj.com/problems/ACQUIRE/en/)↵
[Problem 2](http://www.spoj.com/problems/APIO10A/)↵
[Problem 3](http://codeforces.me/problemset/problem/660/F)↵
[Problem 4](http://codeforces.me/problemset/problem/631/E)↵
[Problem 5](http://codeforces.me/problemset/problem/319/C)↵
[Problem 6](http://codeforces.me/problemset/problem/455/E)↵
[Problem 7](https://www.codechef.com/problems/JUMP)↵
[Problem 8](http://codeforces.me/contest/536/problem/C)↵
[Problem 9](https://www.codechef.com/problems/CYCLRACE)↵
[Problem 10](http://codeforces.me/problemset/problem/377/E)↵
[Problem 11](http://codeforces.me/contest/91/problem/E)↵
↵
**Note:-** Some problems from Divide and conquer optimization section can also be solved using CHT.↵
↵
Please, share your knowledge and links on the topic.
↵
#### **1.Knuth Optimization**↵
↵
Read [This](https://www.quora.com/What-is-Knuths-optimization-in-dynamic-programming) article before solving Knuth optimization problems.↵
↵
[Problem 1](https://uva.onlinejudge.org/external/100/10003.pdf)↵
[Problem 2](https://uva.onlinejudge.org/external/103/10304.pdf)↵
[Problem 3](http://codeforces.me/gym/100212/attachments/download/1727/20042005-winter-petrozavodsk-camp-andrew-stankevich-contest-10-en.pdf) ( **C** )↵
[Problem 4](http://www.spoj.com/problems/BRKSTRNG/)↵
[Problem 5](https://uva.onlinejudge.org/external/120/12057.pdf)↵
[Problem 6](https://uva.onlinejudge.org/external/128/12836.pdf)↵
↵
#### **2. Divide and Conquer Optimization**↵
↵
Read [This](https://www.quora.com/What-is-divide-and-conquer-optimization-in-dynamic-programming) article before solving Divide and Conquer Optimization problems↵
↵
[Problem 1](https://www.codechef.com/problems/CHEFAOR)↵
[Problem 2](http://www.spoj.com/problems/NKLEAVES/)↵
[Problem 3](https://www.hackerrank.com/contests/ioi-2014-practice-contest-2/challenges/guardians-lunatics-ioi14)↵
[Problem 4](https://www.hackerrank.com/contests/world-codesprint-5/challenges/mining)↵
[Problem 5](http://codeforces.me/contest/321/problem/E)↵
[Problem 6](http://acm.timus.ru/problem.aspx?space=1&num=1167)↵
[Problem 7](https://uva.onlinejudge.org/external/125/12524.pdf)↵
[Problem 8](http://codeforces.me/problemset/problem/673/E)↵
[Problem 9](https://arc067.contest.atcoder.jp/tasks/arc067_d)↵
[Problem 10](http://codeforces.me/problemset/problem/834/D)↵
[Problem 11](http://poj.org/problem?id=1741)↵
↵
#### **3. Convex Hull Trick Technique(CHT)**↵
↵
Read [This](http://wcipeg.com/wiki/Convex_hull_trick) article before solving problem based on CHT.↵
↵
[Problem 1](http://www.spoj.com/problems/ACQUIRE/en/)↵
[Problem 2](http://www.spoj.com/problems/APIO10A/)↵
[Problem 3](http://codeforces.me/problemset/problem/660/F)↵
[Problem 4](http://codeforces.me/problemset/problem/631/E)↵
[Problem 5](http://codeforces.me/problemset/problem/319/C)↵
[Problem 6](http://codeforces.me/problemset/problem/455/E)↵
[Problem 7](https://www.codechef.com/problems/JUMP)↵
[Problem 8](http://codeforces.me/contest/536/problem/C)↵
[Problem 9](https://www.codechef.com/problems/CYCLRACE)↵
[Problem 10](http://codeforces.me/problemset/problem/377/E)↵
[Problem 11](http://codeforces.me/contest/91/problem/E)↵
↵
**Note:-** Some problems from Divide and conquer optimization section can also be solved using CHT.↵
↵
Please, share your knowledge and links on the topic.
