You are given an integer array prices where prices[i] is the stock price on day i, and an integer fee representing a transaction fee charged each time you sell.

You may complete as many transactions as you want, but you can hold at most one share of the stock at any time, meaning you must sell before you buy again.

Return the maximum profit you can achieve. The transaction fee fee is paid once per transaction, at the time of selling.

Constraints:

• $1 \leq$ prices.length $\leq 5 \cdot 10^4$

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

• $0 \leq$ fee $< 5 \cdot 10^4$

Input: prices = [5]-List[int], fee = 2-int
Output: 0-int
Explanation: With only one day of prices, you cannot complete a buy-and-sell transaction, so the profit is 0.

Input: prices = [9,8,7,6,5,4]-List[int], fee = 1-int
Output: 0-int
Explanation: The price decreases every day, so any buy followed by a sell would lose money (and also pay a fee), and the best action is to do nothing.

Input: prices = [2,5,1,6,4,9,3,10]-List[int], fee = 2-int
Output: 12-int
Explanation: One optimal set of transactions is buying at 2 and selling at 5 (profit 5 - 2 - 2 = 1), buying at 1 and selling at 6 (profit 6 - 1 - 2 = 3, total 4), buying at 4 and selling at 9 (profit 9 - 4 - 2 = 3, total 7), and buying at 3 and selling at 10 (profit 10 - 3 - 2 = 5, total 12).

Input: prices = [1,4,6,2,8,3,10,14]-List[int], fee = 0-int
Output: 22-int
Explanation: With no transaction fee, you can take all profitable upward moves, for example buying at 1 and selling at 6 (profit 5), buying at 2 and selling at 8 (profit 6, total 11), and buying at 3 and selling at 14 (profit 11, total 22).

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.