Algorithm

SPOJ 6219. Edit Distance (EDIST) with F#

This problem can be solved using dynamic programming with memoization technique. In essence, it is about computing the Edit Distance, also known as, Levenshtein Distance between two given strings. Definition Edit Distance—a.

Zip lists with F#

Problem Statement: Zip two lists of Integers. If the lists are of unequal length, return None; otherwise return Some of (int*int) list. Solution: Following naïve solution recurses over elements of the lists,