Two Sum Less Than K

Explore how to solve the problem of finding the maximum sum of two elements in an integer array that is less than a given number. Understand how to apply sorting and two-pointer methods to efficiently identify valid pairs or return -1 if none exist.