Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

asharammeena's blog

By asharammeena, 4 weeks ago, In English,

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

Edit :- Part 18 of my dynamic programming tutorials is out. I have discussed travelling salesman problem this time.

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

Thank you And happy coding!!!

 
 
 
 
  • Vote: I like it
  • +64
  • Vote: I do not like it

»
4 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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...

»
3 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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.

»
3 weeks ago, # |
Rev. 2   Vote: I like it +5 Vote: I do not like it

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

»
3 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

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

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    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.

»
3 weeks ago, # |
  Vote: I like it +3 Vote: I do not like it

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

Good job!!!

»
3 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

Thanks a lot man

»
3 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Hi, thanks for the tutorials,

I'm seeing a typo I believe:

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

  • »
    »
    3 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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.

»
2 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

thanks

»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

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

  • »
    »
    2 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

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

»
12 days ago, # |
  Vote: I like it 0 Vote: I do not like it

good work

»
12 days ago, # |
  Vote: I like it +2 Vote: I do not like it

Nice effort in collecting these and helping out :)

»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

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!

  • »
    »
    7 days ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    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.

»
84 minutes ago, # |
  Vote: I like it 0 Vote: I do not like it

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.

»
49 minutes ago, # |
  Vote: I like it +3 Vote: I do not like it

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