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$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the problem correctly:

We have a game for you to play. Rearrange the logical building blocks to better understand how to solve this problem.

Implement your solution in the following coding playground.