Grokking the Coding Interview Patterns in JavaScript/

...

/

Solution: 3Sum

Solution: 3Sum

Let's solve the 3Sum problem using the two pointers pattern.

We'll cover the following...

Statement

Given an integer array, nums, find and return all unique triplets [nums[i], nums[j], nums[k]], such that i ≠ \neq j, i ≠\neq k, and j ≠\neq k and nums[i] + nums[j] + nums[k] ==0== 0 ...