# Levenshtein Distance

## Details

The Levenshtein distance is the minimum number of single character edits that are needed to transform one word into another. The available edits are deletion, insertion, or substitution of a single character.

For example the Levenshtein distance between **“shine”** and
**“train”** is 4:

- shine → shin (deletion of 'e')
- shin →
**t**shin (insertion of 't') - t
**s**hin → t**r**hin (substitution of 's' for 'r') - tr
**h**in → tr**a**in (substitution of 'h' for 'a')

For each pair of words per argument, print the Levenshtein distance on its own line.

0 bytes, 0 chars

Restore solution
Compiled from
AT&T syntax to x86-64 Linux. Use
syscalls to write output.

ctrl + enter or