3Sum Closest, is a LeetCode problem from Array subdomain. In this post we will see how we can solve this challenge in Swift

Problem Description

You can find the full details of the problem 3Sum Closest at LeetCode


increment left or decrease right predicated on

          their sum is greater or less than the target

Time Complexity: O(n^2), Space Complexity: O(nC3)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu