โ† Amazon questions

Pair with Largest Sum Less than K

Filed under Amazon

Given an array of integers and an integer K, find a pair of elements whose sum is the largest possible while remaining strictly less than K. Return the maximum sum or -1 if no such pair exists.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.