Dynamic programming tutorials ( Part - 17 is out )

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

Edit :- Part 17 of my dynamic programming tutorials. I will discuss minimum cost polygon triangulation this time.

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

Thank you
And happy coding!!!

6 Likes

Great stuff man :slight_smile:

1 Like

Thank you very much bro!!

1 Like