LeetCode #123 - Best Time to Buy and Sell Stock III You are given an array where the ith element is the price of a given stock on day i. Design an algorithm to find the best time to buy and sell stock to maximize profit. You may complete at most two transactions. Return the maximum profit you can achieve. Input: prices = [3,2,6,5,0,3] Output: Max Profit: 7 Constraints: 1 <= prices.length <= 10^5 0 <= prices[i] <= 10^5