Best Time to Buy and Sell Stock II Leetcode Solution

In this post, we are going to solve the Best Time to Buy and Sell Stock II Leetcode Solution problem of Leetcode. This Leetcode problem is done in many programming languages like C++, Java, and Python.

Table of Contents

Problem

You are given an array prices where prices[i] is the price of a given stock on the i^th day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Example 1:

Input: prices = [7,1,5,3,6,4]
Output: 5
Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.

Constraints:

1 <= prices.length <= 10⁵
0 <= prices[i] <= 10⁴

Now, let’s see the leetcode solution of Best Time to Buy and Sell Stock II Leetcode Solution.

Best Time to Buy and Sell Stock II Leetcode Solution in Python

Best Time to Buy and Sell Stock II Leetcode Solution in CPP

Best Time to Buy and Sell Stock II Leetcode Solution in Java

Note: This problem Best Time to Buy and Sell Stock II is generated by Leetcode but the solution is provided by Chase2learn This tutorial is only for Educational and Learning purpose.