Best Time to Buy and Sell Stock iii | LeetCode 123 | C++, Java, Python

**** CORRECTION: At 9:41 for Pmax value. It should be 4 and not 3.
LeetCode Solutions: • LeetCode Solutions | L...
August LeetCoding Challenge: • Playlist
Github Link: github.com/Kno...
*** Best Books For Data Structures & Algorithms for Interviews:*********
1. Cracking the Coding Interview: amzn.to/2WeO3eO
2. Cracking the Coding Interview Paperback: amzn.to/3aSSe3Q
3. Coding Interview Questions - Narasimha Karumanchi: amzn.to/3cYqjkV
4. Data Structures and Algorithms Made Easy - N. Karumanchi: amzn.to/2U8FrDt
5. Data Structures & Algorithms made Easy in Java - N. Karumanchi: amzn.to/2U0qZgY
6. Introduction to Algorithms - CLR - Cormen, Leiserson, Rivest: amzn.to/2Wdp8rZ
*****************************************************************************
August LeetCoding Challenge | Problem 16 | Best Time to Buy and Sell Stock iii | 16 August,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Best Time to Buy and Sell Stock iii,
Best Time to Buy and Sell Stock iii c++,
Best Time to Buy and Sell Stock iii Java,
Best Time to Buy and Sell Stock iii python,
Best Time to Buy and Sell Stock iii solution,
123. Best Time to Buy and Sell Stock iii,
#CodingInterview #LeetCode #AugustCodingChallenge #Google #Amazon #StockBuySell #dynamicprogramming

[@KnowledgeCenter]

***CORRECTION:: At 9:41 for Pmax value. It should be 4 and not 3. Thanks @Isha for pointing it out.

[@codestorywithMIK]

For the profit2 calculation, instead of starting from beginning , we started from (n-1) i.e. in backward direction. The reason we did that because we will get the profit2 in descending order and when we will be calculating profit1[i] + profit2 [i] , we are sure to get maximum value of profit2 array. Hope this helps.

[@nirmalkumarselvaraj3996]

Thank you, please put dp version of solving for the same problem

[@crankyinmv]

Elegant. Thanks for the video. My solution was also O(n) but not as elegant.

[@isha2567]

I think there is mistake at 9:41 for Pmax value. It should be 4 and not 3 as it is not updated. kzbin.info/www/bejne/Zneun2N8iK6Ej6c

[@KnowledgeCenter]

Thanks for pointing it out. Have added it now to the description, and Comment.

[@harshvardhanr5062]

can u make a video on the solution for atmost k transactions

[@MYUCOZ1]

why we go in opposite direction for the second half?

[@prateekagrawal8166]

why did we put j=n-i-1? What is the logic behind that? I'm not getting it. I mean yes we want to sell atmost "two" times,but why assigning j as n-i-1?

[@parthpandya7833]

Because we have to update the array from second last elememt At Last element profit will be zero

[@jaegukim3599]

Thank You!

[@KnowledgeCenter]

Welcome!