Skip to content
Skein

subset sum

RU: сумма подмножества

The boolean specialization of 0/1 knapsack: can some subset of the given numbers add up to an exact target? Each number is an item whose weight equals its value, and max becomes a logical OR over whether a total is reachable, with reach[0] = true.

shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?