Which of the following methods can be used to solve the edit distance problem?
(a) Recursion
(b) Dynamic programming
(c) Both dynamic programming and recursion
(d) Greedy Algorithm
This question was addressed to me during a job interview.
The origin of the question is Edit Distance Problem topic in portion Dynamic Programming of Data Structures & Algorithms II