Solution: Best Time to Buy and Sell Stock with Transaction Fee

Statement

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 ...