Algorithms explained: Divide et Conquer vs Dynamic Programming

Divide and Conquer (D&C) and Dynamic Programming (DP) are 2️⃣ great algorithmic techniques. Both divide a given problem into subproblems and solve the subproblems. How do you choose which one is better to use for solving a problem ? To answer this qu...