In this lecture, person just started by sharing the steps of the algorithm. no explanation was provided regarding why we are following this approach and how did he came up with this.
Very very bad experience for such type of videos that are there in each section of course.
If someone can explain the solution in doubt section than that would be really helpful.
hi… so basically what u have to do in this question is u have to tell max profit u can earn by doing 2 transactions… it is an extension of ques where we had to tell max profit earned by doing only one transaction
https://ide.codingblocks.com/s/590506 this is my personal soln… if u still have any doubts do let me know…
why we are moving from left to right for one case and right to left for another. Didnt get this
basically u are maintaining 2 dp… first dp store that iss index i tak hm kitna max profit kma skte hai… and in second dp u store iss i ke bad ek transaction krke what max profit we an earn
what if we get max in left_dp in extreme right of array and in extreme left for right_dp??
hi… so actually is is not possible to explain the whole concept through chat… i suggest u to go through the video soln once again
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.