Algorithms · Question 27 · Hard
Algorithms question 27
What is the edit distance (minimum number of single-character insertions, deletions or substitutions) needed to convert "CHENNAI" into "CHAIN"?
- 4
- 5
- 2
- 3
Answer and explanation
Answer: A. 4
Explanation: Keep C and H, delete E, N and N to get CHAI, then insert N at the end: CHAIN, using 4 edits. The edit-distance DP table confirms that 3 edits cannot do it, since 2 deletions are forced and the order of A, I, N still needs fixing.
Previous: Selection sort (ascending) is applied to [29, 10, 14, 37, 13]. In each pass… · Next: Four matrices with dimensions 5×10, 10×3, 3×12 and 12×5 are multiplied as a…
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- What is the solution of the recurrence T(n) = T(n - 1) + n, with T(1) = 1?
- Coins of ₹2, ₹3 and ₹5 are available in unlimited supply. In how many…
- Selection sort (ascending) is applied to [29, 10, 14, 37, 13]. In each pass…
- Four matrices with dimensions 5×10, 10×3, 3×12 and 12×5 are multiplied as a…
- Lomuto partition with the last element as the pivot is applied once to [7, 2…
- What is the length of the longest strictly increasing subsequence of [3, 10…
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge