# 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.

## Problem

You are given an arrayÂ pricesÂ whereÂ prices[i]Â is the price of a given stock on theÂ ithÂ 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 <= 105
• 0 <= prices[i] <= 104

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 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.

Sharing Is Caring