Longest Increasing Subsequence | Recursion & Memo |Tree Diagram |DP Concepts & Qns-11 | Leetcode-300

Channel:

codestorywithMIK

Subscribers:

92,300

Published on August 8, 2023 3:25:46 PM ● Video Link: https://www.youtube.com/watch?v=DG50PJIx2SM

Duration: 32:27

1,171 views

95

Hi Everyone, this is the 11th video of our new Playlist "DP Concepts & Qns''.
Today we will solve another 1-D DP problem Longest Increasing Subsequence (Leetcode-300).

If you have been following my "DP Concepts & Qns" playlist , then these will become very easy.
Make sure to watch from the beginning of this playlist to master DP in the easiest way possible.

My aim is to make DP easy and make everyone believe that once you get clarity , you can solve even DP Qns Easily.
It will no longer be a Nightmare topic for anyone. All I need is your attention for some time and CONSISTENCY.

"If someone can, we can too"

Problem Name : Longest Increasing Subsequence
Company Tags : Microsoft
My solutions on Github : https://github.com/MAZHARMIK/Interview_DS_Algo/blob/master/DP/Longest%20Increasing%20Subsequence.cpp
Leetcode Link : https://leetcode.com/problems/longest-increasing-subsequence/

My DP Concepts Playlist : https://youtu.be/7eLMOE1jnls
My Graph Concepts Playlist : https://youtu.be/5JGiZnr6B5w
My GitHub Repo for interview preparation : https://github.com/MAZHARMIK/Interview_DS_Algo
Subscribe to my channel : https://www.youtube.com/@codestorywithMIK
Instagram : https://www.instagram.com/codestorywithmik/
Facebook : https://www.facebook.com/people/codestorywithmik/100090524295846/
Twitter : https://twitter.com/CSwithMIK


╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝


#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish