Dynamic Programming - Systemantics

UVa 10664. Luggage

08 Mar 2013 1 min read Algorithm

The UVa 10664: Luggage is a typical example of the problems that can be solved using dynamic programming (DP) technique. In fact, after further analysis, this problem can be realized as a special

SPOJ 8545. Subset Sum (Main72) with Dynamic Programming and F#

27 Feb 2013 6 min read Algorithm

The Subset Sum (Main72) problem, officially published in SPOJ, is about computing the sum of all integers that can be obtained from the summations over any subset of the given set (of integers)

SPOJ 346. Bytelandian Gold Coins (COINS) with Dynamic Programming and F#

26 Feb 2013 3 min read Algorithm

The Bytelandian Gold Coins problem, officially published in SPOJ, concerns computing the maximum dollars that can be exchanged for a Bytelandian gold coin. In this post, we outline a solution to this problem

SPOJ 97. Party Schedule (PARTY) with F#

16 Feb 2013 5 min read Algorithm

The Party Schedule problem, published in SPOJ website, is about deriving an optimal set of parties that maximizes fun value, given a party budget: and parties: where each party have an entrance cost

SPOJ 6219. Edit Distance (EDIST) with F#

29 Jan 2013 4 min read Algorithm

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.