Take a problem that you could brute force. Does it have repeating sub problems? ...

		jorblumesea on April 25, 2021 \| parent \| context \| favorite \| on: Dynamic Programming vs. Divide-and-Conquer (2018) Take a problem that you could brute force. Does it have repeating sub problems? If so, it's a candidate for DP. DP and Greedy problems are the hardest to nail because they are the broadest and widest category of problems. Almost everything can be a DP problem.