Zoom SDE Interview Question 2021 May | Dynamic Programming | off-campus

Question 1: Best Time to Buy and Sell Stock III Problem Statement You are given an array prices where prices[i] is the price of a given stock on the i-th day. Find the maximum profit you can achieve. You may complete at most two transactions. Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again). Example Input: prices = [3,3,5,0,0,3,1,4] Output: 6 Explanation: Buy on day 4 (price = 0) and ...