Question: what is the difference between dynamic programming and divide and conquer?
Answer: 8 Answers. Divide and Conquer works by dividing the problem into sub-problems, conquer each sub-problem recursively and combine these solutions. Dynamic Programming is a technique for solving problems with overlapping subproblems.