[Problem] Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution. [Explanation] This problem's goal is to find the sum of three elements which is closest to target. To solve it, two pointer algorithm is used with fixed po..
