Solution: 3Sum

Statement

Given an array of integers, nums, and an integer value, target, determine if there are any three integers in nums whose sum is equal to the target, that is, nums[i] + nums[j] + nums[k] == target. Return TRUE if three such integers exist in the array. Otherwise, return FALSE.

Note: A valid triplet consists of elements with distinct indexes. This means, for the triplet nums[i], nums[j], and nums[k], i $\not =$ j, i $\not =$ k and j $\not =$ k.

Constraints:

• $3$ $\leq$ nums.length $\leq$ $500$
• $-10^3$ $\leq$ nums[i] $\leq$ $10^3$
• $-10^3$ $\leq$ target $\leq$ $10^3$