Given an integer array nums that does not contain any zeros, find the largest positive integer k such that its negation also exists in the array.

Return the value of k. If no such integer exists, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $-1000 \leq$ nums[i] $\leq 1000$

• nums[i] $\neq 0$

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.