Proposal to add "best time to buy and sell stock-III" problem of Letecode123

[Amit-yadav099]

hello @trishan9
I want to contribute in your c++ folder by adding renoun problem :-best time to buy and sell stock -II

problem statement:
You are given an integer array prices where prices[i] is the price of a given stock on the ith day.
On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can buy it then immediately sell it on the same day.
Find and return the maximum profit you can achieve.

example testcase:
Input: prices = [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
Total profit is 4 + 3 = 7.

kindly ,assign this task to me under hacktoberfest2024

[trishan9]

Sure, I assign this issue to you! @Amit-yadav099

[trishan9]

Issue has been assigned to you under Hacktoberfest!

[trishan9]

Happy contribution!

[Amit-yadav099]

thankyou sir , for the task
Happy Contribution.

[Amit-yadav099]

actually sir , i have already submitted this problem on different user repositary
so , here i going to submit its upper verson i,.e, best time to buy and sell the stock -III of leetcode 123(Hard)
sorry for this inconvenience !

[trishan9]

actually sir , i have already submitted this problem on different user repositary so , here i going to submit its upper verson i,.e, best time to buy and sell the stock -III of leetcode 123(Hard) sorry for this inconvenience !

Sure, not a problem! You are open for any contribution!