714. Best Time to Buy and Sell Stock with Transaction Fee LeetCode Solution

In this guide, you will get 714. Best Time to Buy and Sell Stock with Transaction Fee LeetCode Solution with the best time and space complexity. The solution to Best Time to Buy and Sell Stock with Transaction Fee problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Best Time to Buy and Sell Stock with Transaction Fee solution in C++
4. Best Time to Buy and Sell Stock with Transaction Fee solution in Java
5. Best Time to Buy and Sell Stock with Transaction Fee solution in Python
6. Additional Resources

Problem Statement of Best Time to Buy and Sell Stock with Transaction Fee

You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee.
Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction.
Note:

You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
The transaction fee is only charged once for each stock purchase and sale.

Example 1:

Input: prices = [1,3,2,8,4,9], fee = 2
Output: 8
Explanation: The maximum profit can be achieved by:
– Buying at prices[0] = 1
– Selling at prices[3] = 8
– Buying at prices[4] = 4
– Selling at prices[5] = 9
The total profit is ((8 – 1) – 2) + ((9 – 4) – 2) = 8.

Example 2:

Input: prices = [1,3,7,5,10,3], fee = 3
Output: 6

Constraints:

1 <= prices.length <= 5 * 104
1 <= prices[i] < 5 * 104
0 <= fee < 5 * 104

Complexity Analysis

• Time Complexity: O(n)
• Space Complexity: O(1)

714. Best Time to Buy and Sell Stock with Transaction Fee LeetCode Solution in C++

class Solution {
 public:
  int maxProfit(vector<int>& prices, int fee) {
    int sell = 0;
    int hold = INT_MIN;

    for (const int price : prices) {
      sell = max(sell, hold + price);
      hold = max(hold, sell - price - fee);
    }

    return sell;
  }
};
/* code provided by PROGIEZ */

714. Best Time to Buy and Sell Stock with Transaction Fee LeetCode Solution in Java

class Solution {
  public int maxProfit(int[] prices, int fee) {
    int sell = 0;
    int hold = Integer.MIN_VALUE;

    for (final int price : prices) {
      sell = Math.max(sell, hold + price);
      hold = Math.max(hold, sell - price - fee);
    }

    return sell;
  }
}
// code provided by PROGIEZ

714. Best Time to Buy and Sell Stock with Transaction Fee LeetCode Solution in Python

class Solution:
  def maxProfit(self, prices: list[int], fee: int) -> int:
    sell = 0
    hold = -math.inf

    for price in prices:
      sell = max(sell, hold + price)
      hold = max(hold, sell - price - fee)

    return sell
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.