Maximum profit by buying and selling a share at most twice - GeeksforGeeks

14 Mar, 2022
In daily share trading, a buyer buys shares in the morning and sells them on the same day. If the trader is allowed to make at most 2 transactions in a day, whereas the second transaction can only start after the first one is complete (Buy->sell->Buy->sell). Given stock prices throughout the day, find out the maximum profit that a share trader could have made.
Examples: 
Input:   price[] = {10, 22, 5, 75, 65, 80}
Output:  87
Trader earns 87 as sum of 12, 75 
Buy at 10, sell at 22, 
Buy at 5 and sell at 80
Input:   price[] = {2, 30, 15, 10, 8, 25, 80}
Output:  100
Trader earns 100 as sum of 28 and 72
Buy at price 2, sell at 30, buy at 8 and sell at 80
Input:   price[] = {100, 30, 15, 10, 8, 25, 80};
Output:  72
Buy at price 8 and sell at 80.
Input:   price[] = {90, 80, 70, 60, 50}
Output:  0
Not possible to earn.
A Simple Solution is to consider every index ‘i’ and do the following 
Max profit with at most two transactions = MAX {max profit with one transaction and subarray price[0..i] + max profit with one transaction and subarray price[i+1..n-1] } i varies from 0 to n-1.
Maximum possible using one transaction can be calculated using the following O(n) algorithm The maximum difference between two elements such that the larger element appears after the smaller numberThe time complexity of the above simple solution is O(n2).
We can do this O(n) using the following Efficient Solution. The idea is to store the maximum possible profit of every subarray and solve the problem in the following two phases.
1) Create a table profit[0..n-1] and initialize all values in it 0.2) Traverse price[] from right to left and update profit[i] such that profit[i] stores maximum profit achievable from one transaction in subarray price[i..n-1]3) Traverse price[] from left to right and update profit[i] such that profit[i] stores maximum profit such that profit[i] contains maximum achievable profit from two transactions in subarray price[0..i].4) Return profit[n-1]
To do step 2, we need to keep track of the maximum price from right to left side, and to do step 3, we need to keep track of the minimum price from left to right. Why we traverse in reverse directions? The idea is to save space, in the third step, we use the same array for both purposes, maximum with 1 transaction and maximum with 2 transactions. After iteration i, the array profit[0..i] contains the maximum profit with 2 transactions, and profit[i+1..n-1] contains profit with two transactions.
Below are the implementations of the above idea.
C++
Java
Python3
C#
PHP
Javascript
// C++ program to find maximum// possible profit with at most// two transactions#include <bits/stdc++.h>using namespace std; // Returns maximum profit with// two transactions on a given// list of stock prices, price[0..n-1]int maxProfit(int price[], int n){    // Create profit array and    // initialize it as 0    int* profit = new int[n];    for (int i = 0; i < n; i++)        profit[i] = 0;     /* Get the maximum profit with       only one transaction       allowed. After this loop,       profit[i] contains maximum       profit from price[i..n-1]       using at most one trans. */    int max_price = price[n - 1];    for (int i = n - 2; i >= 0; i--) {        // max_price has maximum        // of price[i..n-1]        if (price[i] > max_price)            max_price = price[i];         // we can get profit[i] by taking maximum of:        // a) previous maximum, i.e., profit[i+1]        // b) profit by buying at price[i] and selling at        //    max_price        profit[i]            = max(profit[i + 1], max_price - price[i]);    }     /* Get the maximum profit with two transactions allowed       After this loop, profit[n-1] contains the result */    int min_price = price[0];    for (int i = 1; i < n; i++) {        // min_price is minimum price in price[0..i]        if (price[i] < min_price)            min_price = price[i];         // Maximum profit is maximum of:        // a) previous maximum, i.e., profit[i-1]        // b) (Buy, Sell) at (min_price, price[i]) and add        //    profit of other trans. stored in profit[i]        profit[i] = max(profit[i - 1],                        profit[i] + (price[i] - min_price));    }    int result = profit[n - 1];     delete[] profit; // To avoid memory leak     return result;} // Driver codeint main(){    int price[] = { 2, 30, 15, 10, 8, 25, 80 };    int n = sizeof(price) / sizeof(price[0]);    cout << "Maximum Profit = " << maxProfit(price, n);    return 0;}
class Profit {    // Returns maximum profit    // with two transactions on a    // given list of stock prices,    // price[0..n-1]    static int maxProfit(int price[], int n)    {        // Create profit array        // and initialize it as 0        int profit[] = new int[n];        for (int i = 0; i < n; i++)            profit[i] = 0;         /* Get the maximum profit           with only one transaction           allowed. After this loop,           profit[i] contains           maximum profit from           price[i..n-1] using at most           one trans. */        int max_price = price[n - 1];        for (int i = n - 2; i >= 0; i--) {            // max_price has maximum            // of price[i..n-1]            if (price[i] > max_price)                max_price = price[i];             // we can get profit[i]            // by taking maximum of:            // a) previous maximum,            // i.e., profit[i+1]            // b) profit by buying            // at price[i] and selling            // at            //    max_price            profit[i] = Math.max(profit[i + 1],                                 max_price - price[i]);        }         /* Get the maximum profit           with two transactions allowed           After this loop, profit[n-1]           contains the result         */        int min_price = price[0];        for (int i = 1; i < n; i++) {            // min_price is minimum            // price in price[0..i]            if (price[i] < min_price)                min_price = price[i];             // Maximum profit is maximum of:            // a) previous maximum, i.e., profit[i-1]            // b) (Buy, Sell) at (min_price, price[i]) and            // add            // profit of other trans.            // stored in profit[i]            profit[i] = Math.max(                profit[i - 1],                profit[i] + (price[i] - min_price));        }        int result = profit[n - 1];        return result;    }     // Driver Code    public static void main(String args[])    {        int price[] = { 2, 30, 15, 10, 8, 25, 80 };        int n = price.length;        System.out.println("Maximum Profit = "                           + maxProfit(price, n));    } } /* This code is contributed by Rajat Mishra */
# Returns maximum profit with# two transactions on a given# list of stock prices price[0..n-1]  def maxProfit(price, n):     # Create profit array and initialize it as 0    profit = [0]*n     # Get the maximum profit    # with only one transaction    # allowed. After this loop,    # profit[i] contains maximum    # profit from price[i..n-1]    # using at most one trans.    max_price = price[n-1]     for i in range(n-2, 0, -1):         if price[i] > max_price:            max_price = price[i]         # we can get profit[i] by        # taking maximum of:        # a) previous maximum,        # i.e., profit[i+1]        # b) profit by buying at        # price[i] and selling at        #    max_price        profit[i] = max(profit[i+1], max_price - price[i])     # Get the maximum profit    # with two transactions allowed    # After this loop, profit[n-1]    # contains the result    min_price = price[0]     for i in range(1, n):         if price[i] < min_price:            min_price = price[i]         # Maximum profit is maximum of:        # a) previous maximum,        # i.e., profit[i-1]        # b) (Buy, Sell) at        # (min_price, A[i]) and add        #  profit of other trans.        # stored in profit[i]        profit[i] = max(profit[i-1], profit[i]+(price[i]-min_price))     result = profit[n-1]     return result  # Driver functionprice = [2, 30, 15, 10, 8, 25, 80]print ("Maximum profit is", maxProfit(price, len(price))) # This code is contributed by __Devesh Agrawal__
// C# program to find maximum possible profit// with at most two transactionsusing System; class GFG {     // Returns maximum profit with two    // transactions on a given list of    // stock prices, price[0..n-1]    static int maxProfit(int[] price, int n)    {         // Create profit array and initialize        // it as 0        int[] profit = new int[n];        for (int i = 0; i < n; i++)            profit[i] = 0;         /* Get the maximum profit with only        one transaction allowed. After this        loop, profit[i] contains maximum        profit from price[i..n-1] using at        most one trans. */        int max_price = price[n - 1];         for (int i = n - 2; i >= 0; i--) {             // max_price has maximum of            // price[i..n-1]            if (price[i] > max_price)                max_price = price[i];             // we can get profit[i] by taking            // maximum of:            // a) previous maximum, i.e.,            // profit[i+1]            // b) profit by buying at price[i]            // and selling at max_price            profit[i] = Math.Max(profit[i + 1],                                 max_price - price[i]);        }         /* Get the maximum profit with two        transactions allowed After this loop,        profit[n-1] contains the result */        int min_price = price[0];         for (int i = 1; i < n; i++) {             // min_price is minimum price in            // price[0..i]            if (price[i] < min_price)                min_price = price[i];             // Maximum profit is maximum of:            // a) previous maximum, i.e.,            // profit[i-1]            // b) (Buy, Sell) at (min_price,            // price[i]) and add profit of            // other trans. stored in            // profit[i]            profit[i] = Math.Max(                profit[i - 1],                profit[i] + (price[i] - min_price));        }        int result = profit[n - 1];         return result;    }     // Driver code    public static void Main()    {        int[] price = { 2, 30, 15, 10, 8, 25, 80 };        int n = price.Length;         Console.Write("Maximum Profit = "                      + maxProfit(price, n));    }} // This code is contributed by nitin mittal.
<?php// PHP program to find maximum// possible profit with at most// two transactions // Returns maximum profit with// two transactions on a given// list of stock prices, price[0..n-1]function maxProfit($price, $n){    // Create profit array and    // initialize it as 0    $profit = array();    for ($i = 0; $i < $n; $i++)        $profit[$i] = 0;     // Get the maximum profit with    // only one transaction allowed.    // After this loop, profit[i]    // contains maximum profit from    // price[i..n-1] using at most    // one trans.    $max_price = $price[$n - 1];    for ($i = $n - 2; $i >= 0; $i--)    {        // max_price has maximum        // of price[i..n-1]        if ($price[$i] > $max_price)            $max_price = $price[$i];         // we can get profit[i] by        // taking maximum of:        // a) previous maximum,        //    i.e., profit[i+1]        // b) profit by buying at        // price[i] and selling at        // max_price        if($profit[$i + 1] >           $max_price-$price[$i])        $profit[$i] = $profit[$i + 1];        else        $profit[$i] = $max_price -                      $price[$i];    }     // Get the maximum profit with    // two transactions allowed.    // After this loop, profit[n-1]    // contains the result    $min_price = $price[0];    for ($i = 1; $i < $n; $i++)    {        // min_price is minimum        // price in price[0..i]        if ($price[$i] < $min_price)            $min_price = $price[$i];         // Maximum profit is maximum of:        // a) previous maximum,        //    i.e., profit[i-1]        // b) (Buy, Sell) at (min_price,        //     price[i]) and add        // profit of other trans.        // stored in profit[i]        $profit[$i] = max($profit[$i - 1],                          $profit[$i] +                         ($price[$i] - $min_price));    }    $result = $profit[$n - 1];    return $result;} // Driver Code$price = array(2, 30, 15, 10,               8, 25, 80);$n = sizeof($price);echo "Maximum Profit = ".      maxProfit($price, $n);     // This code is contributed// by Arnab Kundu?>
<script> // JavaScript program to find maximum// possible profit with at most// two transactions // Returns maximum profit with// two transactions on a given// list of stock prices, price[0..n-1]function maxProfit(price, n){         // Create profit array and    // initialize it as 0    let profit = new Array(n);    for(let i = 0; i < n; i++)        profit[i] = 0;     /* Get the maximum profit with    only one transaction    allowed. After this loop,    profit[i] contains maximum    profit from price[i..n-1]    using at most one trans. */    let max_price = price[n - 1];    for(let i = n - 2; i >= 0; i--)    {                 // max_price has maximum        // of price[i..n-1]        if (price[i] > max_price)            max_price = price[i];         // We can get profit[i] by taking maximum of:        // a) previous maximum, i.e., profit[i+1]        // b) profit by buying at price[i] and selling at        // max_price        profit[i] = Math.max(profit[i + 1],                            max_price - price[i]);    }     // Get the maximum profit with    // two transactions allowed    // After this loop, profit[n-1]    // contains the result    let min_price = price[0];    for(let i = 1; i < n; i++)    {                 // min_price is minimum price        // in price[0..i]        if (price[i] < min_price)            min_price = price[i];         // Maximum profit is maximum of:        // a) previous maximum, i.e., profit[i-1]        // b) (Buy, Sell) at (min_price, price[i]) and add        // profit of other trans. stored in profit[i]        profit[i] = Math.max(profit[i - 1],                profit[i] + (price[i] - min_price));    }    let result = profit[n - 1];     return result;} // Driver codelet price = [ 2, 30, 15, 10, 8, 25, 80 ];let n = price.length; document.write("Maximum Profit = " +               maxProfit(price, n)); // This code is contributed by Surbhi Tyagi. </script>
  
Maximum Profit = 100
The time complexity of the above solution is O(n). 
Algorithmic Paradigm: Dynamic Programming 
Another approach:
Initialize four variables for taking care of the first buy, first sell, second buy, second sell. Set first buy and second buy as INT_MIN and first and second sell as 0. This is to ensure to get profit from transactions. Iterate through the array and return the second sell as it will store maximum profit.
C++
Java
Python3
C#
Javascript
#include <iostream>#include<climits>using namespace std; int maxtwobuysell(int arr[],int size) {    int first_buy = INT_MIN;      int first_sell = 0;      int second_buy = INT_MIN;      int second_sell = 0;             for(int i=0;i<size;i++) {                   first_buy = max(first_buy,-arr[i]);//we set prices to negative, so the calculation of profit will be convenient          first_sell = max(first_sell,first_buy+arr[i]);          second_buy = max(second_buy,first_sell-arr[i]);//we can buy the second only after first is sold          second_sell = max(second_sell,second_buy+arr[i]);           }     return second_sell;} int main() {     int arr[] = {2, 30, 15, 10, 8, 25, 80};      int size = sizeof(arr)/sizeof(arr[0]);      cout<<maxtwobuysell(arr,size);    return 0;}
import java.util.*;class GFG{ static int maxtwobuysell(int arr[],int size) {    int first_buy = Integer.MIN_VALUE;      int first_sell = 0;      int second_buy = Integer.MIN_VALUE;      int second_sell = 0;             for(int i = 0; i < size; i++) {                   first_buy = Math.max(first_buy,-arr[i]);          first_sell = Math.max(first_sell,first_buy+arr[i]);          second_buy = Math.max(second_buy,first_sell-arr[i]);          second_sell = Math.max(second_sell,second_buy+arr[i]);           }     return second_sell;} public static void main(String[] args){    int arr[] = {2, 30, 15, 10, 8, 25, 80};      int size = arr.length;      System.out.print(maxtwobuysell(arr,size));}} // This code is contributed by gauravrajput1
import sys def maxtwobuysell(arr, size):    first_buy = -sys.maxsize;    first_sell = 0;    second_buy = -sys.maxsize;    second_sell = 0;     for i in range(size):         first_buy = max(first_buy, -arr[i]);        first_sell = max(first_sell, first_buy + arr[i]);        second_buy = max(second_buy, first_sell - arr[i]);        second_sell = max(second_sell, second_buy + arr[i]);          return second_sell; if __name__ == '__main__':    arr = [ 2, 30, 15, 10, 8, 25, 80 ];    size = len(arr);    print(maxtwobuysell(arr, size)); # This code is contributed by gauravrajput1
using System; public class GFG{ static int maxtwobuysell(int []arr,int size) {    int first_buy = int.MinValue;      int first_sell = 0;      int second_buy = int.MinValue;      int second_sell = 0;             for(int i = 0; i < size; i++) {                   first_buy = Math.Max(first_buy,-arr[i]);          first_sell = Math.Max(first_sell,first_buy+arr[i]);          second_buy = Math.Max(second_buy,first_sell-arr[i]);          second_sell = Math.Max(second_sell,second_buy+arr[i]);           }     return second_sell;} public static void Main(String[] args){    int []arr = {2, 30, 15, 10, 8, 25, 80};      int size = arr.Length;      Console.Write(maxtwobuysell(arr,size));}} // This code is contributed by gauravrajput1
<script>    function maxtwobuysell(arr , size) {        var first_buy = -1000;        var first_sell = 0;        var second_buy = -1000;        var second_sell = 0;         for (var i = 0; i < size; i++) {             first_buy = Math.max(first_buy, -arr[i]);            first_sell = Math.max(first_sell, first_buy + arr[i]);            second_buy = Math.max(second_buy, first_sell - arr[i]);            second_sell = Math.max(second_sell, second_buy + arr[i]);         }        return second_sell;    }              var arr = [ 2, 30, 15, 10, 8, 25, 80 ];        var size = arr.length;        document.write(maxtwobuysell(arr, size)); // This code is contributed by gauravrajput1</script>
100
Time Complexity: O(N)
Auxiliary Space: O(1)
nitin mittal
andrew1234
rambabuy
nidhi_biet
doshiruhal
marix101
divyeshrabadiya07
Mukul Lunia
katariarishu95
RohitOberoi
surbhityagi15
Rajput-Ji
pranavkushwaha506
rajsanghavi9
ambujsingh2000
dewanshipaul84
umadevi9616
GauravRajput1
juyal_sid
amartyaghoshgfg
sharmanandini1677
Dynamic Programming
Mathematical
Dynamic Programming
Mathematical
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Floyd Warshall Algorithm | DP-16
Matrix Chain Multiplication | DP-8
Travelling Salesman Problem | Set 1 (Naive and Dynamic Programming)
Edit Distance | DP-5
Overlapping Subproblems Property in Dynamic Programming | DP-1
Write a program to print all permutations of a given string
C++ Data Types
Set in C++ Standard Template Library (STL)
Merge two sorted arrays
Modulo Operator (%) in C/C++ with Examples