Dynamic Programming | Set 3 (Longest Increasing Subsequence) | GeeksforGeeks

This video is contributed by Kanika Gautam.

[dronaacharya]

Thank you ;
The hardwork behind slides and detailed and ellobaration of algorithm is really appreciated ;

[killeraloo]

After 6 years, still, GFG videos are valuable and to the point.

I didn't want to watch long videos, I solved this problem some time ago.
This is just hitting the nail at every timestamp.

No second is wasted.

Thanks @GeeksforGeeks.


🧡 from remote.

[vijay]

Have been struggling with dynamic programming and recursive solutions confused the hell out of me though they have better time complexity.So, great job on explaining the concept very clearly. Perhaps 1 of the best explanation of the impl of a dynamic programming solution.

[praharshsingh]

LOGIC FOR L I S [ I ] < L I S [J] + 1


lis[i] denotes the current max value stored and if the lis[j]+1 is greater than that then only we will update the lis[i].

[doodledicemonsters]

Thank you for making a short video with a quick demonstration

[skhafizulislam]

nice .. easy to understand .. JAI HIND

[rmiliming]

wow, thanks a lot for this clear and patient explanation and the visuals!

[Krato]

3 years down the line and they modified the question with the condition that difference between adjacent elements of the longest sub sequence must also be increasing!

[bhargavacharan]

superb explanation. I have been struggling to get an idea of this. But now i am clear. Thanks a lot

[nirjharroy]

Excellent work, explained in short time in efficient way

[muralivideos]

Finest explanation i have seen for this problem so far. Thank you

[GDBthest]

Very good explanation, but please avoid calling the function Lis() and the temp array also lis[] this is bad programming practice.

[yaseminakturk]

It is the worst explanation that I saw. She is just talking instead of showing what she is doing.

[saisrinivassinu]

The explanation is okay but the solution is of O(n*n). But for GFG the solution has to be of O(n*logn).

[SmartProgramming]

good explanation sir, keep it up 👍👍🙂🙂

[dipakprajapati]

short and simple solution. nicely done.

[TheJuancar]

What if as output is not only required length but also an array with a solution for that LIS.

[vikaschoubey]

thank you. this video solved a problem which i have trying to solve for a long time.

[md.nahiyanuddin]

amazingly discussed and explained everything .. keep up the good work guys ..

[banglarbairebangali]

madam please explain by bactracking also