Leetcode Problem 1099. Two Sum Less Than K

1099. Two Sum Less Than K

Leetcode Solutions

Sort the array nums.
Initialize two pointers, left set to 0 and right set to len(nums) - 1.
Initialize answer to -1 to keep track of the maximum sum found that is less than k.
While left is less than right: a. Calculate the sum of nums[left] and nums[right]. b. If the sum is less than k, update answer with the maximum of answer and the sum, then increment left. c. If the sum is greater or equal to k, decrement right.
Return answer.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen