DP 41. Longest Increasing Subsequence | Memoization

Lecture Notes/C++/Java Codes: https://takeuforward.org/dynamic-prog...
Problem Link: https://bit.ly/3rVoIoq

Please watch the video at 1.25x for a better experience.

Pre-req for this Series:    • Re 1. Introduction to Recursion | Rec...  
a
Make sure to join our telegram group for discussions: https://linktr.ee/takeUforward

Full Playlist:    • Striver's Dynamic Programming Series ...  

In this video, we solve the LIS problem with DP. In the next video we have learnt about the next method using tabulation.

If you have not yet checked our SDE sheet, you should definitely do it: https://takeuforward.org/interviews/s...

You can also get in touch with me at my social handles: https://linktr.ee/takeUforward