3Sum

Statement

Given an integer array nums, find and return all unique triplets [nums[i], nums[j], nums[k]], where the indexes satisfy i$\neq$j, i$\neq$k, and j$\neq$k, and the sum of the elements nums[i] + nums[j] + nums[k] == 0.

Constraints:

• $3 \leq$ nums.length $\leq 500$

• $-10^3 \leq$ nums[i] $\leq 10^3$

Examples