Given an int array `nums` and an int `target`. Find two integers in `nums` such that the sum is closest to `target`.\n\n**Example 1:**\n```\nInput: nums = [1, 2, 3, 4, 5], target = 10\nOutput: [4, 5]\n```\n\n**Example 2:**\n```\nInput: nums= [-1, 2, 1, -4], target = 4\nOutput: [2, 1]\n```\n\nhttps://leetcode.com/problems/two-sum-less-than-k (premium)

Given an int array nums and an int target. Find two integers in nums such that the sum is closest to target.\n\nExample 1:\n\nInput: nums = [1, 2, 3, 4, 5], tar

Google | Onsite | Two Sum - Closest to Target