Hello guys,

I have started my personal programming blog and I will be writing about dynamic programming in next few posts. So, please read them and correct me if I am wrong somewhere. Also, please share the blog if you like the articles.

Part 1 — Longest common subsequnce : Dynamic programming tutorials Part 1.

Part 2 — Longest increasing subsequence: Dynamic programming tutorials Part-2

Part 3 — Binary number without consecutive 1's: Dynamic programming tutorials part 3

Part 4 — Maximum size sub matrix with all 1's: Dynamic programming tutorials part 4

Part 5 — Ways to cover a distance: Dynamic programming tutorials part 5

Part 6 — Longest Palindromic subsequenec: Dynamic programming tutorials part-6

Part 7 — Minimum edit distance (Levinshtein distance): Dynamic programming tutorials part-7

Part 8 — Weighted Job Scheduling: Dynamic programming tutorials part-8

Part 9 — Palindromic Partitioning: Dynamic programming tutorials part-9

Part 10 — Boolean Parenthesization : Dynamic programming tutorials part-10

Part 11 — Matrix chain multiplication : Dynamic programming tutorials part-11

Part 12 — Egg dropping : Dynamic programming tutorials part-12

Part 13 — Non crossing lines on a circle: Dynamic programming tutorials part-13

Part 14 — Word break: Dynamic programming tutorials part-14

Part 15 — Box Stacking: Dynamic programming tutorials part-15

Part 16 — Longest Increasing Path: Dynamic Programming tutorials part-16

Part 17 — Minimum cost polygon triangulation: Dynamic Programming tutorials part-17

Part 18 — Travelling Salesman: Dynamic Programming tutorials part-18

Part 19 — Maximum plus sum in a Matrix: Dynamic Programming Tutorials part-19

Part 20 — Number of Palindromic Paths in a Matrix: Dynamic Programming Tutorials part-20

Part 21 — K-Palindromes: Dynamic Programming Tutorials Part-21

Part 22 — Wild Card Matching: Dynamic Programming Tutorials Part-22

Part 23 — Equal Sum Partition: Dynamic Programming Tutorials Part-23

Edit :- Part 24 of my dynamic programming tutorials is out. I have discussed Longest Arithmetic Progression this time.

PART 24 — Longest Arithmetic Progression: Dynamic Programming Tutorials Part-24

Thank you And happy coding!!!

Very good work! The way you explained things will definetely help beginers to get a good feel of basics of dynamic programming. And do write further and all the best...

Thank you very much bro!!! Keep reading and happy coding

How often will you post an article? I'm looking for more!

I will try to post daily except during my exam days. You can subscribe to my blog so that you gets a notification everytime I post a new article.

also you can look at this blog, it's useful for study DP. -> https://codeforces.com/blog/entry/67679

P.S. sorry for my english

Thank you! This blog is really great

Thank you,I am learning dp

How are you choosing problems which you recommend in each blog ?

Currently, I am choosing the random dp problems with easy-medium tag on codechef and codeforces. I think doing a random problem after reading the blog will help reader to learn something new everytime. If you have any other suggestion for this, then, please tell me.

A beginner like me is realy eager for a lot of blogs...!

Good job!!!

Thank you bro!

Thanks a lot man

Your most welcome bro!!

Hi, thanks for the tutorials,

I'm seeing a typo I believe:

it must be if i == j, not if i == 1

Yeah, thanks for pointing it out. I have request to all of you that if you have any doubt or you find any mistake, then, please comment in the blog itself.

thanks

https://codeforces.com/problemset/problem/550/C

Can you write something about the kind of DP used in this question. Thanks!

I will write once I am done writing about standard dp problems.

good work

Thank you!!

Nice effort in collecting these and helping out :)

Thank you!!

Hey i have one weird question from you. The examples you are teaching us by your blog — do u learnt those from somewhere else? or u did brainstorming too!

If I would have been brainstorming, then, how will I explain the solution to you?:-D Obviously I have to learn and understand them properly to be able to explain them to you.

Thank you for these tutorials. I found them quite helpful. I will suggest you to add problems for upsolving which are related to the concept of the tutorial if possible.

Thanks bro!! Sure I will add one random and one problem related to concept.

Thank you bro. Really nice explanation. Hope to see more articles in the future.

Thank you buddy!!

Hey man! Check out the following link Dynamic Programming – Interview Questions & Practice Problems