[LeetCode] Two Sum Less Than K

1 · · April 1, 2022, 4:37 a.m.
1099. Two Sum Less Than K Given an array nums of integers and integer k, return the maximum sum such that there exists i < j with nums[i] + nums[j] = sum and sum < k. If no i, j exist satisfying this equation, return -1. ...