One edit away

Hard

Let's say you're given two strings a and b.

Write a function that determines if the strings are one or zero edits away from eachother.

Consider a single edit as one of the following:

For example, given the two strings:

a = "car"
b = "bar"

Your function should return True, since there is only one character replaced.

Another example:

a = 'baby'
b = 'babies'

Your function should return False since a and b are more than 1 edit away from eachother.

Try it first

def edit_distance(a: str, b: str) -> bool:
    # implement edit_distance
    return False

1def edit_distance(a: str, b: str) -> bool:
2    # implement edit_distance
3    return False
4

Master Strings by trying the coding challenges below.

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.