Advanced Exercism • powershell

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 @RichMath (⭐ 0) — View on Exercism
Solution 2 by @apulkGIT (⭐ 0) — View on Exercism
Solution 3 by @VickMahase (⭐ 0) — View on Exercism

Source: Exercism powershell/knapsack

💡 View Solution

Function Get-MaximumValue() {
    <#
    .SYNOPSIS
    Implement a function to solve the classic knapsack problem.

    .DESCRIPTION
    Given a knapsack with a specific carrying capacity (W), determine the maximum value we can get from the list of items.
    Note that each item can only be taken once.

    All values given will be strictly positive.