You are given an integer array nums of length n, where each element is either $1$ or $-1$, and an integer k.

In one operation, you can select an index i such that $0 \le i < n - 1$ and multiply both nums[i] and nums[i + 1] by $-1$.

Return true if it is possible to make all elements in nums equal using at most k operations, and false otherwise.

Constraints:

• $1 \le n ==$ nums.length $\le 10^5$

• nums[i] is either $-1$ or $1$.

• $1 \le k \le n$

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.