9 / 75
Sort and use two pointers to find triplets summing to zero, skipping duplicates.
Example:
Input:
[-1,0,1,2,-1,-4]Output:
[[-1,-1,2],[-1,0,1]]Common Mistakes:
- Off-by-one indexing
- Not handling edge cases (null/empty)
Notes:
Edge cases: duplicates, empty inputs, negative numbers where applicable.
💻
Java Solution Hidden
Enable “Show Full Solution” to view the code
Sort and use two pointers to find triplets summing to zero, skipping duplicates.
Example:
Input:
[-1,0,1,2,-1,-4]Output:
[[-1,-1,2],[-1,0,1]]Common Mistakes:
- Off-by-one indexing
- Not handling edge cases (null/empty)
Notes:
Edge cases: duplicates, empty inputs, negative numbers where applicable.
9/75
3Sum