Vidyalelo
Data Structure · Q211

Dynamic Programming in Data Structures

Programming · Data Structure · question 211

Q211

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
Answer
D.
Greedy Algorithm

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board