Dynamic Programming vs Divide-and-Conquer

👉🏻 https://trekhleb.dev/blog/2018/...

In this article, I’m trying to figure out the difference/similarities between dynamic programming and divide and conquer approaches based on two examples - binary search and minimum edit distance (Levenshtein distance).

The DP concept is still a subject to learn for me, but I hope the article will be helpful for those who are also in the process of learning.