Leetcode journey - Question 16 - 3Sum Closest

Problem: Q16. 3Sum Closest 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...