Dynamic Programming vs Divide-and-Conquer
In this article Iām trying to explain the difference/similarities between dynamic programing and divide and conquer approaches based on two examples - binary search and minimum edit distance (Levenshtein distance)
Dynamic Programming Seam Carving Programming Extension Difference Between Conquer Example Programming Example
Source: trekhleb.dev