Two Pointers
Three Sum
mediumLeetCodeJS / TS7 tests
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.
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: []
JavaScript & TypeScript starter code included
Run this as a live interviewPractice solo
7 test cases. No second person needed.