Alice and Bob have candy boxes of various sizes, represented by integer arrays aliceSizes and bobSizes, where aliceSizes[i] is the number of candies in the candy box Alice owns at index i, and bobSizes[j] is the number of candies in the candy box Bob owns at index j.

They wish to exchange exactly one candy box each so that, after the exchange, they both have the same total amount of candy.

Return an integer array containing two elements [aliceSizes[i], bobSizes[j]], where aliceSizes[i] is the size of the candy box Alice trades and bobSizes[j] is the size of the candy box Bob trades. If there are multiple valid answers, you may return any one of them.

Constraints:

• $1 \leq$ aliceSizes.length, bobSizes.length $\leq 10^4$

• $1 \leq$ aliceSizes[i], bobSizes[j] $\leq 10^5$

• Alice and Bob have a different total number of candies.

• There will be at least one valid answer for the given input.

Now, 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 correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.