Solution: 3Sum

Explore how to solve the 3Sum problem by using the two pointer technique on a sorted array to find unique triplets summing to zero. Understand how to skip duplicates, optimize with sorting, and analyze time and space complexity for an efficient solution.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

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$
$-$ ...