Problemintro
3SUM
Also called 3-SUM, three sum problem, three-sum.
Given n integers, decide whether three of them sum to zero; the classic quadratic-time problem.
Given n integers, decide whether three of them sum to zero; the classic quadratic-time problem.
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 BM50B0 Edit this page History Report an error