3Sum - Read Statement

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

The solution must not contain duplicate triplets.