How would you solve the problem of finding two numbers in an array such that the sum is less than k and also closest to k?
