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.
Problem Statement:
Given a list, write a function to reverse every K element when k is an input to the function.
Example:
Input: [1;2;3;4;5;6;7;8] and k
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,
Following code snippet shows how to compute bound (i.e the min and max elements) of a List using F#.
[gist]4511020[/gist]
Solution outlined here is quite trivial and use the pattern
Problem Definition
Details about this problem is available here. Required Background Topic: Cyclic quadrilateral.
Solution
Given that the length of the sides are {a,b,c,d}, the Maximal Quadrilateral Area is given