0
The problem is:
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] where i, j and k are distinct and nums[i] + nums[j] + nums[k] == 0.
The solution set must not contain duplicate triplets and the order of the output and the order of the triplets does not matter.
Th...