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
I had been asked this question during an interview.
This interesting question is from Dynamic Programming topic in division Dynamic Programming of Data Structures & Algorithms II