MCQ Practice

Which of the following problems is NOT solved using dynamic programming?

A

0/1 knapsack problem

B

Matrix chain multiplication problem

C

Edit distance problem

D

Fractional knapsack problem

Correct Answer: D