Leetcode 1099. Two Sum Less Than K

Given an array of integers and an integer K, find the largest sum of any two distinct elements that is strictly less than K (return -1 if no such pair exists). This is a classic two-sum variant often solved by sorting and a two-pointer sweep to efficiently find the maximal valid pair.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1099. Two Sum Less Than K

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact