Longest Palindromic Subsequence | Using Blue Print | DP On Strings | Leetcode 516 | DP Concepts - 25

[@HimanshuSingh-mt4tg]

Thank you for the making coding more interesting lvyu 3000❤

[@codestorywithMIK]

Love you all 3000 ❤️

[@tanishchordia4813]

Thank you mik you are truly a gem of a person You literally took our request seriously and started the dp concepts and questions playlist again. Mik We all seriously love you.❤

[@Engineeringlife651]

Bhaiya can you bring a course on dsa the way you explain the topic everything becomes crystal clear

[@souravjoshi2293]

thanks a lot

[@jiteshsingh98]

😍

[@Believe_yourself-eo1ho]

Please upload more videos as soon as possible

[@EB-ot8uu]

thank you so much for continuing this playlist. much needed

[@gauravbanerjee2898]

Thanks a lot bhaiya ❤❤

[@wearevacationuncoverers]

guruji aap dhany ho

[@rushikeshkadam7768]

Bhaiya, i am following your graph concepts and questions playlist.
can you provide pdf notes of that playlist, it will be very helpful.
Thank you such amazing videos.

[@CODDING.A]

82. Remove Duplicates from Sorted List II ---- sir please solve this problem

[@AdarshGupta-dn5bx]

Bhai, pls complete this only first. You make concepts extremely clear. I'll be highly thankful if you complete it first 🙏

[@jiteshsingh98]

Khata Khat Khata Khat Khata khat😂

[@priyanshusain2274]

Please make a video for problem no 2477

[@dayashankarlakhotia4943]

public int longestIdealString(String s){
char[]c=s.toCharArray();
int n=c.length;
int[]dp=new int[n];
dp[0]=1;
for(int i=1;i=0;j--){
int next=dp[j];
if(c[i]==c[j]){
dp[j]=2+max;
}
max=Math.max(max,next);
}
}
int maxLen=0;
for(int i:dp)
maxLen=Math.max(maxLen,i);
return maxLen;
}
tc=(n*n)
Sc=(n);
this is space optimization code🎉❤