Two Sum Less Than K, 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 Two Sum Less Than K at LeetCode


Note: Directly using two points and update values correspondly to try to solve the

  problem with O(n) time complexity does not work -- it has too many edge cases.

Time Complexity: O(n), Space Complexity: O(n)

Please check the main.swift snippet for the solution.

This solution originally posted at: Github by @soapyigu