Solution: 3Sum

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$ k, and j $\neq$ k and nums[i] + nums[j] + nums[k] $== 0$ ...