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$.

Note: The order of the triplets in the output does not matter.

Constraints:

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

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