OurBigBook About$ Donate
 Sign in Sign up

3SUM

Ciro Santilli (@cirosantilli, 37) ... Computer Computer science Computational problem Function problem Functional problem with array as input Subset sum problem
Updated 2025-07-16  1 By others on same topic  0 Discussions Create my own version
Tags: Simple to state but hard to prove
It is cool how even for such a "simple looking" problem, we were still unable to prove optimality as of 2020!
  • Table of contents
    • Two sum problem 3SUM

Two sum problem

 0  0
3SUM

 Ancestors (10)

  1. Subset sum problem
  2. Functional problem with array as input
  3. Function problem
  4. Computational problem
  5. Computer science
  6. Computer
  7. Information technology
  8. Area of technology
  9. Technology
  10.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

3SUM by Wikipedia Bot 0
 View more
The 3SUM problem is a classic algorithmic problem in computer science, particularly in the fields of computer algorithms and complexity theory. The problem can be stated as follows: Given an array of integers, the task is to determine if there exist three distinct indices \( i, j, k \) such that the sum of the elements at these indices is equal to zero, i.e.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook