In this video I will discuss the problem of finding the longest increasing subsequence.
Longest Increasing Subsequence
1. Dynamic Programming Approach O(N^2)
2. Analyzing the DP approach
3. Making some Observations
4. Proving the Observations
5. Optimizing to O(NlogN)
Problem Link: https://cses.fi/problemset/task/1145
For implementation part watch: https://youtu.be/wqLwv7E1GF0
Enjoy Watching!
Make sure to like, share and subscribe :)
Super useful books for algo ds and programming fundamentals!
1. Introduction to Algorithms by Cormen: https://amzn.to/35AmQqu
2. The Algorithm Design Manual: https://amzn.to/2K9RGPq
3. Fundamentals of Data Structures in C++: https://amzn.to/2LCwIsN
4. Object-Oriented Programming by E Balagurusamy: https://amzn.to/2Xxmdtr
5. Head First Java: https://amzn.to/39kb44K
6. Cracking the coding interview: https://amzn.to/3iDOHLK
7. Database System concepts: https://amzn.to/3pisuFQ
8. Operating Systems: https://amzn.to/39fcmis
9. Discrete Mathematics: https://amzn.to/2MlgCE6
10. Compiler Design: https://amzn.to/3pkYvx2
