Challenge¶
Here's a CSV file with 1,000 distinct U.S. baby 👶 names (all lowercase).
How many distinct (A, B) pairs of names have Levenshtein distance ≤ 3?
If your result includes (aaden, allen), make sure it doesn't also include (allen, aaden).
Loading the data¶
You can load the data directly from GitHub.
:::::::
::::::::