<p>Given an integer array nums, return all the triplets <code>[nums[i], nums[j], nums[k]]</code> such that <code>i != j</code>, <code>i != k</code>, and <code>j != k</code>, and <code>nums[i] + nums[j] + nums[k] == 0</code>.</p> <p>Notice that the solution set must not contain duplicate triplets.</p> <p> </p> <p><strong>Example 1:</strong></p> <pre><strong>Input:</strong> nums = [-1,0,1,2,-1,-4] <strong>Output:</strong> [[-1,-1,2],[-1,0,1]] </pre><p><strong>Example 2:</strong></p> <pre><strong>Input:</strong> nums = [] <strong>Output:</strong> [] </pre><p><strong>Example 3:</strong></p> <pre><strong>Input:</strong> nums = [0] <strong>Output:</strong> [] </pre> <p> </p> <p><strong>Constraints:</strong></p> <ul> <li><code>0 <= nums.length <= 3000</code></li> <li><code>-10<sup>5</sup> <= nums[i] <= 10<sup>5</sup></code></li> </ul>