Given an array nums of n integers 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.
Click here
Sort array. Iterate with three pointers, moving them if needed. O(n^2) time, O(n) space if allocating new array, O(1) space if not allocating.Run make to run python and Swift files.