• 0

    Given an unsorted array [-5,1,10,3,2] find all unique triplets that sum to zero. For example in the above example, we get two such results [-5,-5,10] and [-5,3,2]. Remember that the indicies can be reused in this problem.

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.