Solution: 3Sum
Let's solve the 3Sum problem using the two pointers pattern.
We'll cover the following...
Statement
Given an integer array nums, find and return all unique triplets [nums[i], nums[j], nums[k]], where the indexes satisfy ij, ik, and jk, and the sum of the elements nums[i] + nums[j] + nums[k] == 0.
Constraints:
...
Access this course and 1400+ top-rated courses and projects.