Coding Round 1
Mid-Level
programming
LeetCode #15 - 3Sum
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. Note that the solution set must not contain duplicate triplets.Function Signature:
Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation: The distinct triplets that sum up to zero are [-1,-1,2] and [-1,0,1].Example 2:
Input: nums = []
Output: []
Explanation: There are no triplets that satisfy the condition.Constraints:
def threeSum(nums: List[int]) -> List[List[int]]:Example 1:Input: nums = [-1,0,1,2,-1,-4]
Output: [[-1,-1,2],[-1,0,1]]
Explanation: The distinct triplets that sum up to zero are [-1,-1,2] and [-1,0,1].Example 2:
Input: nums = []
Output: []
Explanation: There are no triplets that satisfy the condition.Constraints:
- 0 <= nums.length <= 3000
- -10^5 <= nums[i] <= 10^5
Suggested Answer