Please in order to save solutions and appear on the leaderboards.

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:

  1. shine → shin (deletion of 'e')
  2. shin → tshin (insertion of 't')
  3. tshin → trhin (substitution of 's' for 'r')
  4. trhin → train (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
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
TeX is an experimental language, no solutions will be saved. Please leave feedback on the GitHub issue.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Levenshtein Distance?

If you have seperate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.