Two Sum Less Than K

Try to solve the Two Sum Less Than K problem.

We'll cover the following

Statement

Given an array of integers, nums, and an integer k, find the maximum sum of two elements in nums less than k. Otherwise, return −1−1 if no such pair exists.

Constraints:

  • 1≤1\leq nums.length ≤100\leq100

  • 1≤1\leq nums[i] ≤103\leq 10^3

  • 1≤1\leq k ≤103\leq 10^3

Examples

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.