Maybe you’ve heard about it in preparing for coding interviews. Maybe you’ve struggled through it in an algorithms course. Maybe you’re trying to...
For further actions, you may consider blocking this person and/or reporting abuse
Hii, Aliana this is an awesome post I haven't made it all the way through but till how much I have read,it's simpler to understand maybe it's because I have already studied it but the thinking process is very good and it's awesome to go through the process of problem solving with DP.
Great post! I'm going to have to re-read it a few times to make sure I follow completely. This is a subject that needs a lot of demystifying for me 😝
Haha it's a long one, but it had to be because I couldn't miss a single detail about dynamic programming. 😂 Thanks for reading!
This technique it's great and very useful, and kinda reminds me about cache memories, but it flaws when it's about not discrete data, which occurs so many times. That's when approximate-result or sub-optimal solutions come in.
PS: great article and sorry for my English D:
Good read. Caught my attention since I’m supposed to hold a guest lecture tomorrow about programming for IBM iSeries, think I might have a topic now! 🤓
Although I’ve never intentionally used DP professionally, it does remind me of caching n-dimensional arrays with known partial solutions.
In the midst of application season myself, this looks super great. Thanks for the write-up.
This is definitely the best explanation to understand Dynamic Programming so far; although it would simplify more if you can explain more about each of the variables in the mathematical recurrence!