3 Sum
Solution ApproachWas this helpful?
Medium•array•Expected: O(n²) time, O(1) space
two-pointerssorting
Problem
Given an integer array, find all unique triplets that sum to zero.
Example 1:
Input: nums = [-1, 0, 1, 2, -1, -4]
Output: [[-1, -1, 2], [-1, 0, 1]]
Example 2:
Input: nums = [0, 0, 0]
Output: [[0, 0, 0]]
Reference solution unlocks after your first submission
Loading...