search

noisefilter19 / LeetCode_Algorithms

A collection of solutions for Medium/Hard LeetCode problems. Educational resource
111 stars 355 forks source link

161. | One Edit Distance | Python #699

Open sudoShikhar opened 3 years ago

sudoShikhar commented 3 years ago

Problem name: One Edit Distance Difficulty: Medium Language: Python

Given two strings s0 and s1 determine whether they are one or zero edit distance away. An edit can be described as deleting a character, adding a character, or replacing a character with another character.

This is a pretty tricky question.

Requesting to be assigned to this issue.

sudoShikhar commented 3 years ago

@noisefilter19 Requesting you to assign the issue to allow me to pull request.