3Sum - Unique Triplets with Zero Sum
Given an integer array
nums, return all unique triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and the sum of the elements is exactly zero: nums[i] + nums[j] + nums[k] == 0. Constraints: 3 <= nums.length <= 3000 -10^5 <= nums[i] <= 10^5 The solution set must not contain duplicate triplets.JavaTwo PointersSorting
00