Saved from https://leetcode.com/problems/two-sum-less-than-k/

lc1099

class Solution:
    def twoSumLessThanK(self, nums: List[int], k: int) -> int:
        nums.sort()
        res = -1
        l, r = 0, len(nums) - 1
        while l < r:
            curr_sum = nums[l] + nums[r]
            if curr_sum >= k:
                r -= 1
            else:
                res = max(curr_sum, res)
                l += 1
                
        return res