mpanje-fanuel / devshackintl-interview Goto Github PK

Edit Distance

Given two strings left and right and below operations that can performed on left. Find minimum number of edits (operations) required to convert left into right.
Insert
Remove
Replace
All of the above operations are of equal cost.

Examples:

Input: left = "devshack", right = "devshackIntl"
Output: 4
We can convert left into right by removing 'I', ‘n’, ‘t’, and ‘l’.

Input: left = "cat", right = "cut"
Output: 1
We can convert left into right by replacing 'a' with 'u'.

Input: left = "sunday", right = "saturday"
Output: 3

Last three and first characters are same. We basically
need to convert "un" to "atur". This can be done using
below three operations.
Replace 'n' with 'r', insert t, insert a

Solve the issue by editing the WordDistanceCalculator class