3Sum - Unique Triplets Summing to Zero

Given an integer array `nums`, return all the triplets `[nums[i], nums[j], nums[k]]` such that `i != j`, `i != k`, and `j != k`, and `nums[i] + nums[j] + nums[k] == 0`. Notice that the solution set must not contain duplicate triplets. ### Constraints - `3 <= nums.length <= 3000` - `-10^5 <= nums[i] <= 10^5` ### Input Format A single line of space-separated integers representing `nums`. ### Output Format Print each unique triplet on a new line with space-separated numbers sorted ascendingly (triplets sorted lexicographically). If none, print nothing.