3Sum

Try to solve the 3Sum problem.

Statement

Given an integer array, nums, find and return all unique triplets [nums[i], nums[j], nums[k]], such that i \neq j, i \neq ...