Vidyalelo
Data Structure · Q83

Dynamic Programming in Data Structures

Programming · Data Structure · question 83

Q83

Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.

A.
True
Answer
B.
False

Answer: Option A

Solution

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