0/1 Knapsack Problem

null

Aman Mehara

dynamic programming

Levenshtein Distance
Partition Problem
Subset Sum Problem

See all 4 posts →

dynamic programming

Subset Sum Problem

A special case of 0/1 Knapsack Problem Given a finite set $S = \{ s \in \mathbb{Z}_+\}$ and an integer $t < 0 $, is there a subset

Aman Mehara

1 min read

mathematics

Quadratic Equations

When $a \ne 0$ , there are two solutions to $ax^2 + bx + c = 0$ and they are $x = {-b \pm \sqrt{b^2-4ac} \over 2a}.$ Discriminant: $D = b^2-4ac$ If $\alpha$ and \(\beta\

Aman Mehara

1 min read

Aman Mehara

—

0/1 Knapsack Problem