← Questions
Three sum: unique value triples
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return every unique triple of values from an integer array that sums to zero (or to a given target), with no duplicate triples in the output. Sort, then fix one value and move two pointers, skipping duplicates.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding