Sign inSign in

Knapsack problem

A problem of finding a subset of weights that sums to a particular target sum, which is NP-complete in its general form.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A problem where you must select a subset of items, each with a size and value, to maximize total value without exceeding a total capacity.
    • 43:17Dynamic Programming III: Parenthesization, Edit Distance, Knapsack

Connections

6

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.