DP 29. Minimum Insertions to Make String Palindrome 

The ans for minimum no. of deletions to make a string palindrome will also be same because if we just remove the characters which are not a part of the lps(longest palindromic subsequence) we'll get the ans...which is same as n-len(lps)

TOTALLY UNDERSTOOD... !!! That just blew up my mind... Thank you striver for the video... :)

Hi Striver, I have been following your videos for the past three months and dp series since last week. I really had to admit how graceful you are in teaching, I thank you a lot for your contribution and today I solved myself this question without looking into the solution and now I am going to watch it to make a note of your points if I had missed anything. And since I started your dp series, I have handwritten all the things that you had said and I am also finding it very useful for revision. Thanks again

Previously, I heard that DP is some sort of topic, people use to leave, but now after watching each and every video of Striver, I must say you just made it the easiest. Write the recursion -> change it to memoization -> change it to tabulation. And the relation you develop between questions, is just incredible. Keep growing.

i did this by own !!! i am loving it that i came up to the solution by own . Thank You Striver !!

52% done .... striver bro u build my logic ... now i can solve any pattern of dp taught till now .... and also i solved all the problems by myself when u just write sudo code for new topic .... thanks striver bro ...

I initially tried with my own and with way you teach I was able to solve it by my own. Thanks understood one more lecture.

hats off to you !!! Proved that , every topic is easy if you got the right teachings..

Solved this without even watching. Thanks bro

man GOD level stuff Striverrr, it was a leetcode HARD problem, but the logic you told makes it look a EASY level problem!!!! Thanks a lotttt!!

Amazing , thanks Striver

Beautiful explanation. 0% chance I would figure that out at an interview tho, if i didn't already know it

did this que by myself , thank you striver

"Logic formed just by seeing example test cases" came to video to insure that i am thinking right THANKU Striver

Understood! A small clarification - at 8:35 , when you kept the palindromic section in tact, shouldn't you have taken "cod" instead of "codi" while switching? That along with "sajn" would give the minimum insertions to be 3+4 = 7 right?

UNDERSTOOD.......Thank You So Much for this wonderful video...........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

Understood....the way u explain DP, seems like DP is piece of cake!!

Waoooh... Previous lecture concept move this LC hard level question to medium level

hats off to you

Understood!! LCS pattern can help us solve so many problems!! Thanks Striver

Thanks a lot bro..... I really appreciate you!

understood, thank you so much.

understood striver !!!

man hatsoff to you striver Intuition just clicked in by just seeing the topic of video, and converted it into code under just 5 mins and easily did a leetcode hard problem so thanks again striver for such an amazing content

Understood! I really really appreciate for your explanation!!

Understood. Thankyou sir

"UNDERSTOOD BHAIYA!!"

8:06 promotion at its best XD. Understood as always Striver!

Understood sir!

Minimum Insertions To make palindrome = (length of string - * length of longest palindromic Subsequence *) [DP 29], and Length of Longest palindromic Subsequence = (* longest common Subsequence * between String and its Reverse ) [DP 28] And longest common Subsequence, we know it already !! [DP 25] What a link ! matlab questions naye ate jaa rhe h bss , baki jitna sikha h unhi me se uska solution mil rha h, thoda observation acha ho toh 😀 man gye bhai ! ❤ Itni ache se design ki h playlist ki aap gadhe se Gadhe ko bhi sikha skhtein ho, bs uski sikhne ki ichha ho

got the logic just after your first exmaple. Thank you Raj bhaiya

Terrific explanation. Thank you so much !!!

Understood ❤

great video

BESTTT TEACHERRR EVERRR!!!!!!!!!!!!!!!!1

understood!!.

Understood, sir. Thank you very much.

thank you

Thank You Understood!!!!!

understood!

Bhaiyaa we are so so grateful for your content and effort🙏❤

Understood. Amazing explanation!

Bhaiya i understood the concepts upto dp on subsequences very well also did the questions without watching or seeing the solutions but this dp on string topic , i understand the solution properly but can't do problem by my own . Anyway ... understoo the solution. Thanks ❤

Understood!

please do word break & word break ii. thanks

Understood!!!Thank you

Understood !!

understood sir, u are amazing , love the way u teach.

demn i just tried the question first without starting video, just changed return dp[n][n] to n-dp[n][n], and lol it worked, and on leetcode it was a hard ques, I didn't believe, so I saw ur video, and yea it was indeed easy, after doing the LPS ques.

Awesome!! Understood!!

This is a Hard category question on leetcode but u made it a piece of cake lmao ❤

Best❤

understood :)❤

Understood, thanks a ton

understood.

your videos are awesome. Please suggest system design related training

Understood Thanks Striver ❤

got the idea @ 5:19 we can do length()-LPS thank you striver for such amazing videos

Understood Sir thank you very much

Understood !!!!!

i did this question in another way and that is accepted with 100 % score. Kindly take a look.... Memoized solution - int f(int l, int r, string &str, vector &dp) { if (l >= r) return 0; if (dp[l][r] != -1) return dp[l][r]; if (str[l] == str[r]) return dp[l][r] = f(l + 1, r - 1, str, dp); else return dp[l][r] = 1 + min(f(l + 1, r, str, dp), f(l, r - 1, str, dp)); } int minInsertion(string &str) { int n = str.size(); int a = 0, b = str.size() - 1; vector dp(n, vector(n, -1)); return f(a, b, str, dp); } Tabulation - int minInsertion(string &str) { int n = str.size(); int a = 0, b = str.size() - 1; vector dp(n, vector(n, 0)); for (int l = n - 2; l >= 0; l--) { for (int r = l + 1; r < n; r++) { if (str[l] == str[r]) dp[l][r] = dp[l + 1][r - 1]; else dp[l][r] = 1 + min(dp[l + 1][r], dp[l][r - 1]); } } return dp[a][b]; } Thanks Striver for this complete DP playlist.

Understood

We are glad to have u brother

Just want to say... You are awesome striver😇😇

understood

Striver thankyou first time in dp i did this question without watched your video thanks

ye badhiya tha guru...ji...

All Character (at opposite position) which are not part of longest palindromic subsequence

understooodd!!!!

how can we print the modified string which will be palindrome string after minimum no operations

US, mindblowing explanation

Understood. You made dp easy.

Understood🌻

Understood🔥🔥

bro made leetcode hard look like a lollypop thanks striver loving this dp series

Understood Bhai. Have a request. Is it possible to explain the logic and code for the "look and say" or "count and say" problem bro? thanks in advance. it would really help if you could.

LCS is just Like Striver....It helps us to solve most of the problems ........Sorry for the PJ #UNDERSTOOD

*As we are not passing the string by reference '&' then also the code is running fine, can anyone explain this*

understood 👍

understood bhai , thanks !

Great!!

😅 Understood 😊

understood 29/57 completed!

Thanks

Understood !!!🥰🥰🥰

Understood 🎉

Understood❤

Enlightenment

understood!!

Understood 👍

How to print the converted string? I mean after insertions, The final palindromic string

UNDERSTOOD ...

Understood.

Bhaiya muje string ke question mai bilkul confident nhi hai mai wo kese strong kru aapne?

Understood 🥰

understood bhaiya❤❤

Understood!!!

understood❤❤❤

Done and dusted in DP revision Nov'14, 2023 05:54 pm

Understood kaka!