Given two integer arrays x and y of the same length n, find three distinct indices i, j, and k such that the values x[i], x[j], and x[k] are all pairwise distinct.

Return the maximum possible value of y[i] + y[j] + y[k]. If it is impossible to choose three indices satisfying this condition, return $-1$.

Constraints:

• n == x.length == y.length

• $3 \leq$ n $\leq 10^5$

• $1 \leq$ x[i], y[i] $\leq 10^6$

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.