The problem states that the maximum number of transactions are two: We are given a list of integers representing stock prices; we must find the maximum profit that can be made assuming at most two no overlapping BUY – SELL transactions.
5 karma · joined September 29, 2017