Given an integer array nums and an integer k, modify the array by selecting an index i and replacing nums[i] with -nums[i] exactly k times. You may select the same index i multiple times.

Return the maximum possible sum of the array after applying k modifications.

Constraints:

• $1 \leq$ nums.length $\leq 10^4$

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

• $1 \leq$ k $\leq 10^4$

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.