Dynamic Programming - Table Of Content

#<links>

1. quora links
1. Are-there-any-good-resources-or-tutorials-for-dynamic-programming-besides-the-TopCoder-tutorial
2. How-can-I-effectively-practice-Dynamic-Programming-to-improve-my-skills
3. What-are-systematic-ways-to-prepare-for-dynamic-programming/answer/Michal-Danil%C3%A1k
2. DP problems on codeforces
3. DP problems categorized in codeforces
4. Dynamic Programming Optimizations
5. non trivial dp tricks by zscoder
6. Everything about dp
7. TOPCODER TUTORIAL
1. https://community.topcoder.com/tc?module=Static&d1=features&d2=040104
2. https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/
8. shakil vaia's blog
9. shafaet's planet

#<knapsack, coin change or similar>

Problems:

lightoj:

1. 1047
2. 1200
3. 1231
4. 1232
5. LOJ 1017 - Brush (III)

uva:

1. 147
2. 357
3. 562
4. 674
5. 990
6. 1213
7. 10130
8. 10664
9. 11137

SPOJ:

1. KNAPSACK- knapsack problem
2. RPLB - blueberries

#<bitmask>

Problems:

Lightoj:

1. 1011
2. 1018 *
3. 1021
4. 1037
5. 1057
6. 1061 *
7. 1158
8. 1264 *
9. 1316 *
10. 1327

#<Longest Common Subsequence>

Problems:

lightoj:

1. 1110
2. 1159
3. 1013 love calculator

#<Longest Increasing Subsequence>

Problems:

uva:

1. 111
2. 231
3. 481
4. 497
5. 10131

#<Digit DP>

Problems:
Lightoj:

1. 1032
2. 1068
3. 1140
4. 1205

uva:

1. uva 10036

#<Interval DP>

1. LOJ 1031 - Easy Game

#<Probability and Expected Value>

Problems:

Lightoj:

1. 1030
2. 1027 discovering maze
3. 1050 marbles
4. 1038 race to 1 again
5. lightoj 1064 throwing dice

#<String Edit>

1. LOJ 1033 - Generating Palindromes
2. LOJ 1051 - Good or Bad

#<Prefix DP>

Problems:

1. SPOJ  Alphacode - Counting DP
2. LOJ 1044 - Palindrome Partitioning

#<Grid Reduction/Traversal DP>

Problems:
Lightoj:

1. 1036
2. LOJ 1004 - Monkey Banana Problem
3. LOJ 1071 - Baker Vai
4. LOJ 1005 - Rooks

SPOJ:

1. SPOJ Philosophers Stone
2. SPOJ Martian

#<Palindrome related>

Problems:

Lightoj:

1. 1025
2. 1033

#<Non Classical>

Problems:

Lightoj:

1. 1005
2. 1057
3. 1122
4. 1191

uva:

1. 10721
2. 10910
3. 10943
4. 11407

#<DP on Tree>

#<Edit Distance>

#<Subset Mask>

#<Loop Reduction DP>

#<Space Reduction DP>

Dynamic Programming - Table Of Content

#<links>

1. quora links
1. Are-there-any-good-resources-or-tutorials-for-dynamic-programming-besides-the-TopCoder-tutorial
2. How-can-I-effectively-practice-Dynamic-Programming-to-improve-my-skills
3. What-are-systematic-ways-to-prepare-for-dynamic-programming/answer/Michal-Danil%C3%A1k
2. DP problems on codeforces
3. DP problems categorized in codeforces
4. Dynamic Programming Optimizations
5. TOPCODER TUTORIAL
1. https://community.topcoder.com/tc?module=Static&d1=features&d2=040104
2. https://www.topcoder.com/community/data-science/data-science-tutorials/dynamic-programming-from-novice-to-advanced/
6. shakil vaia's blog
7. shafaet's planet

#<knapsack, coin change or similar>

Problems:

lightoj:

1. 1047
2. 1200
3. 1231
4. 1232
5. LOJ 1017 - Brush (III)

uva:

1. 147
2. 357
3. 562
4. 674
5. 990
6. 1213
7. 10130
8. 10664
9. 11137

SPOJ:

1. KNAPSACK- knapsack problem
2. RPLB - blueberries

#<bitmask>

Problems:

Lightoj:

1. 1011
2. 1018 *
3. 1021
4. 1037
5. 1057
6. 1061 *
7. 1158
8. 1264 *
9. 1316 *
10. 1327

#<Longest Common Subsequence>

Problems:

lightoj:

1. 1110
2. 1159
3. 1013 love calculator

#<Longest Increasing Subsequence>

Problems:

uva:

1. 111
2. 231
3. 481
4. 497
5. 10131

#<Digit DP>

Problems:
Lightoj:

1. 1032
2. 1068
3. 1140
4. 1205

uva:

1. uva 10036

#<Interval DP>

1. LOJ 1031 - Easy Game

#<Probability and Expected Value>

Problems:

Lightoj:

1. 1030
2. 1027 discovering maze
3. 1050 marbles
4. 1038 race to 1 again
5. lightoj 1064 throwing dice

#<String Edit>

1. LOJ 1033 - Generating Palindromes
2. LOJ 1051 - Good or Bad

#<Prefix DP>

Problems:

1. SPOJ  Alphacode - Counting DP
2. LOJ 1044 - Palindrome Partitioning

#<Grid Reduction/Traversal DP>

Problems:
Lightoj:

1. 1036
2. LOJ 1004 - Monkey Banana Problem
3. LOJ 1071 - Baker Vai
4. LOJ 1005 - Rooks

SPOJ:

1. SPOJ Philosophers Stone
2. SPOJ Martian

#<Palindrome related>

Problems:

Lightoj:

1. 1025
2. 1033

#<Non Classical>

Problems:

Lightoj:

1. 1005
2. 1057
3. 1122
4. 1191

uva:

1. 10721
2. 10910
3. 10943
4. 11407

#<DP on Tree>

#<Edit Distance>

#<Subset Mask>

#<Loop Reduction DP>

#<Space Reduction DP>

Graph - table of contents

1. 2nd best shortest path.
2. Articulation Point and Bridge finding

Number Theory From Scratch to Things I know

This Blog Post will be updated time to time. I will update when I think I have learnt something new and need to keep note. In this post I will mainly focus on theory along with code.
Though working code for my cookbook will be also updated in Dropbox and google drive as well.

1.Greatest Common Divisor.
2.Least Common Multiple of Two Numbers.
3.Primes: Primality Testing,Generating Primes ( Sieve of Eratosthenes).