Advanced Exercism • fsharp

Knapsack

Challenge Overview

Given a knapsack that can only carry a certain weight, determine which items to put in the knapsack in order to maximize their combined value.

Visit the knapsack exercise on Exercism to read the full instructions and download the exercise files.

Community Solutions

View Community Solutions

The following are the top 3 community solutions by stars:

Solution 1 by @ErikSchierboom (⭐ 0) — View on Exercism
Solution 2 by @gogent01 (⭐ 0) — View on Exercism
Solution 3 by @ADSouthern (⭐ 0) — View on Exercism

Source: Exercism fsharp/knapsack

💡 View Solution

module Knapsack

type Item = { weight: int; value: int }

let rec maximumValue items maximumWeight =
    match items with
    | [] -> 0
    | item :: rest when item.weight > maximumWeight -> maximumValue rest maximumWeight
    | item :: rest ->
        max