You are given two integer arrays prices and strategy of the same length, along with an even integer k.

The initial total profit is defined as the sum of strategy[i] * prices[i] across all indices i.

You are allowed to perform at most one operation: select a contiguous subarray of strategy of length k, and modify its elements such that the first $\frac{k}{2}$ elements are set to $0$ and the remaining $\frac{k}{2}$ elements are set to $1$.

Return the maximum possible total profit that can be achieved.

Constraints:

• $2 \leq$ prices.length $=$ strategy.length $\leq 10^5$

• $1 \leq$ prices[i] $\leq 10^5$

• $-1 \leq$ strategy[i] $\leq 1$

• $2 \leq$ k $\leq$ prices.length

• k is even

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.