Given an integer array nums, find all unique triplets [nums[i], nums[j], nums[k]] where i, j, and k are distinct indices, such that the three elements sum to zero.

The result must not contain any duplicate triplets. The order of the output and the order of elements within each triplet does not matter.

Note: The solution set must only include unique triplets. Two triplets are considered duplicates if they contain the same elements regardless of ordering.

Constraints:

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

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

The key intuition behind this solution is to reduce the ...