Vidyalelo
Data Structure · Q278

Dynamic Programming in Data Structures

Programming · Data Structure · question 278

Q278

Wagner-Fischer algorithm is used to find . . . . . . . .

A.
Longest common subsequence
B.
Longest increasing subsequence
C.
Edit distance between two strings
Answer
D.
Longest decreasing subsequence

Answer: Option C

Solution

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