Tap here to switch tabs

Problem

Submissions

Solution

Solution: Two Sum Less Than K

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$ if no such pair exists.

Constraints:

$1\leq$ nums.length $\leq100$
$1\leq$ nums[i] $\leq 10^3$
$1\leq$ k $\leq 10^3$

Solution

This solution uses the following approaches to find the maximum of the two values, which is less than k.

Sorting: The array is first sorted in ...

⋮

Tap here to switch tabs

Problem

Submissions

Solution

Solution: Two Sum Less Than K

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$ if no such pair exists.

Constraints:

$1\leq$ nums.length $\leq100$
$1\leq$ nums[i] $\leq 10^3$
$1\leq$ k $\leq 10^3$

Solution

This solution uses the following approaches to find the maximum of the two values, which is less than k.

Sorting: The array is first sorted in ...