Find two numbers in an array that add up to a specific target sum.

A variation of the Two Sum problem where the input array is sorted.

Find a pair of numbers in an array such that their sum is less than a specified value, K.

Given an array, find all unique triplets that sum to zero.

Find the triplet in an array whose sum is closest to a given target value.