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

MCQ Practice

Subject: ComputerTopic: Dynamic Programming In Data Structures

Longest common subsequence

Longest increasing subsequence

Edit distance between two strings

Longest decreasing subsequence

Correct Answer: C

Related MCQs