README.md

One Away Strings

Problem Description

Write a function that takes two strings and returns True if they are one away from each other. They are one away from each other if a single operation (changing a character, deleting a character, or adding a character) will change one of the strings to the other.

Examples:

• "abcde" and "abcd" are one away (deleting a character)
• "a" and "a" are one away (changing the only character 'a' to the equivalent character 'a')
• "abc" and "bcc" are NOT one away. (They are two operations away)

Solution

I've written an implementation that determines the solution in O(n) time complexity, where n is the number of characters in the longer string.

• JavaScript
  • Solution
  • JS Test File
  • CodeSandbox
• Python