Maximum Sum Increasing Subsequence | Dynamic Programming | MSIS | LIS

CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

========================================================================
Join this channel to get access to perks:

=======================================================================

USEFUL VIDEOS:-

#dp #msis #lis

[shriyajaswani]

Thankuh🤠🥺 Understanding these hard problems to a level that you can make others understand it. then thinking out of the best way to explain it and also providing it for free. 🥺

[ashishranjan]

You should also have gone for NlogN approach. But whatever was there, it was well explained.

[swaroopkv]

where we are checking if subsequence are in increasing order we r checking only element at i is greater than element at j

[RahulKumar-wfxx]

Sir can you please make a video of Maximum product subarray problem as i feel it to be quite confusing and btw i follow your channel regularly !!

[shanmukhchandrayama]

is there any solution of o(nlogn) timecomplexity similar to that of lcs in nlogn

[E__ShameemahamedS-bxed]

i=0
prev=min element in array-1
int msis (arr [], i, prev)
{
if (i==n)
return 0
if (prev>arr [i]) // exclusion case
return msis (arr [], i+1, prev)
else // max of include or exclude
return max (msis (arr [], i+1, prev), arr [i]+msis (arr [], i+1, arr [i])
}





I tried myself before seeing Ur solution
Pls reply will this work?

[sanjeetsingh]

Hi thanks for the LIS videos, can you also make the N log N version of LIS ?

[shubham-]

Sir pls upload videos on c++ stl like comparators, vector, pair, list, set or oops concept