DP 41. Longest Increasing Subsequence | Memoization

Description

Lecture Notes/C++/Java Codes: https://takeuforward.org/dynamic-programming/striver-dp-series-dynamic-programming-problems/

Problem Link: https://bit.ly/3rVoIoq

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

Pre-req for this Series: https://www.youtube.com/watch?v=yVdKa8dnKiE&list=PLgUwDviBIf0rGlzIn_7rsaR2FQ5e6ZOL9

a

Make sure to join our telegram group for discussions: https://linktr.ee/takeUforward

Full Playlist: https://www.youtube.com/watch?v=FfXoiwwnxFw&list=PLgUwDviBIf0qUlt5H_kiKYaNSqJ81PMMY

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/strivers-sde-sheet-top-coding-interview-problems/

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

Designed under CodEX ©2025 Nexus

Designed under CodEX ©2025 Nexus

Designed under CodEX ©2025 Nexus