A string S of length between 2 and 30. The characters are taken from the 95 printable ASCII characters, byte values 32 (0x20
) to 126 (0x7E
) (
to ~
)
Your code must compute and output all strings within [Levenshtein][1] distance 2 of S. You can have duplicates as long as you also have all the different strings, and the output may be in any order.