Weekend Programming Challenge – Week #69 Levenshtein Distance



Levenshtein Distance  is string metrics for measuring the difference between two sequences. Make code which inputs two strings and calculate Levenshtein Distance between them.

The rules:

You can code the solution in any programming language during the weekend and have to submit it to info@olimex.com latest on Sunday November 18th.

On Monday we will upload the solutions on GitHub https://github.com/OLIMEX/WPC

You can play with your real name or with nick if you want to be anonymous, we will not disclosure your personal info if you do not want to.


1 Comment (+add yours?)

  1. timclimber
    Jul 31, 2015 @ 16:01:55

    Here is another article about fuzzy string matching: http://yurichev.com/blog/fuzzy_string/


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: