arnab2001 / DSA

Collection of DSA problems and solutions
37 stars 185 forks source link

added edit distance problem #385

Closed 77Spencer77 closed 2 years ago

77Spencer77 commented 2 years ago

added a standard dynamic programming problem. Problem statement : Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.

You have the following three operations permitted on a word:

Insert a character Delete a character Replace a character