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

Levenshtein Distance


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.

Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
Top-level programs are supported, args holds ARGV.
ARGV is available via STDIN, joined on NULL. x is a no-op.
ARGV is available via STDIN, joined on NULL.
arguments holds ARGV, print() to output with a newline, write() to output without a newline.
say() is available without any import.
$args to access the arguments.
SELECT arg FROM argv to access the arguments, only the first column of the first result set will be printed, NULL values will be skipped, and the dialect is SQLite.
ctrl + enter or Run