approved

Haskell translation

I thought it was too easy, then I thought it was wrong. Now I see that this will take a bit more thinking.

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.

Fixed. You might need to reset your trainer to see the fixed version of example tests.

It only seems to work on node 8

ReferenceError: Test is not defined
Looks like there a error in the Sample Tests. (JS Version)

I thought the same exact thing

How is this a 6th kyu? Min 5 in my opinion

added

approved (though a couple more sample tests would not hurt, there is only 1)

A must of the cryptography series, breaking the code is so fun.

https://www.codewars.com/kumite/65f993396f5d9400244c7329?sel=65f993396f5d9400244c7329

rust translation - my first translation, please be verbose if you have feedback :)

Approved