The description says "the Levenshtein distance between two words is the minimum number of single-character edits", how is deleting "na" a single character edit?

So to go from "nayvyedosf" to "sjxen" you are required:

1. delete "n"
2. delete "a"
3. change "y" to "s"
4. change "v" to "j"
5. change "y" to "x"
6. change "e" to "e" - yeah I get it now
7. change "d" to "n"
   and then from 8) to 10) delete "osf"

I was stupid.

thanks!

If those are sample tests, you messed them up, click reset.

    doTest("foobar000", "foobar001");
    doTest("foobar999", "foobar1000");

You should see that.

this is amazing actually