Practice 3Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets.
Source: 3Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [-1,0,1,2,-1,-4]
Output
[[-1,-1,2],[-1,0,1]]
# Example 2
Input
nums = [0,1,1]
Output
[]
# Example 3
Input
nums = [0,0,0]
Output
[[0,0,0]]
Constraints
3 <= nums.length <= 3000
-10^5 <= nums[i] <= 10^5
Related LeetCode Problems
Practice more problems similar to 3Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.