Solution: Best Time to Buy and Sell Stock IV

Statement

Given an integer array prices where prices[i] represents the price of a stock on the $i^{th}$ day, and an integer k, determine the maximum profit achievable by completing at most k transactions (i.e., buying at most k times and selling at most k times).

Note: Multiple transactions cannot be held simultaneously — the current stock must be sold before purchasing again.

Constraints:

• ...