The Levenshtein distance (Edit distance) Problem in Python

[soggy-mushroom]

Information about Algorithm

The Levenshtein distance between two words is the minimum number of single-character edits (i.e., insertions, deletions, or substitutions) required to change one word into the other

Have you read the Contributing.md and Code of conduct

• [x] Yes
• [ ] No

Other context

I have noticed that Python section doesn't have this problem, could you please assign it to me? Regards

[welcome[bot]]

Thanks for opening your first issue here! Be sure to follow the issue template!

[karthiknadar1204]

i would like to work on this,please assign it to me