Given an array prices where prices[i] is a stock's price on day i, find the maximum profit from at most k buy-sell transactions (k = 2 in the original), where you must sell before buying again and…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.