Solution: Sum of Three Values
Let's solve the 3Sum problem using the Two Pointers pattern.
Statement
Given an integer array, nums, find and return all unique triplets [nums[i], nums[j], nums[k]], such that i j, i k, and j k and nums[i] + nums[j] + nums[k]