Problemcore
k-SUM
Also called generalized subset sum over sorted lists, k-SUM problem.
Given n integers, decide whether k of them sum to zero (or to a target value).
Given n integers, decide whether k of them sum to zero (or to a target value).
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag D9FDCV Edit this page History Report an error