28 Minimum number of deletion in a string to make it a palindrome

[@0anant0]

27 of 50 (54%) done! I like how some of these problems are just a couple of lines in addition to the previous one.

[@kailashjangir1530]

bro what was in 27th video??

[@abhishekkumar-hv1ey]

@@kailashjangir1530 some guy said it was palidromic substring

[@thegreekgoat98]

@@abhishekkumar-hv1ey where is the video now?

[@derilraju2106]

@@thegreekgoat98 Longest Palindromic substring

[@nehaagarwal6544]

I am just loving this series. I am able to solve questions before playing some of the videos. Kudos to your planning and teaching technique!!

[@nikhilnagrale]

hey do you got placed. Please tell

[@sudhanshu4102]

same here :D

[@bite091_jamee7]

same bro

[@thebongrider1511]

I solved a LC hard question(1312) just when you started explaining the i/p and o/p for this problem.Thanks for giving me that much of confidence. Keep up the good work bro. Society needs u :)

[@zeta_meow_meow]

thank bro ...teri vajah se mera bhi hogaya vo question :)

[@rushiprajapati4597]

Thank You I am also solved This Question..

[@AjitKushwaha-m5j]

i did as well :)

[@ThePROestRedn99]

​@@AjitKushwaha-m5j me too

[@hulkstar0808]

me tooo

[@CompilationError]

only one word . great . youtube should add a "love" button

[@aakashyadav6228]

Its 2050. Tesla just launched flying cars in India. Rahul gandhi has finally taken oath as the next prime minister of india. Yet still aditya bhaiya has not uploaded 27th video.

[@TheAdityaVerma]

😂😂😂😂😂😂😂😂😂

[@pranavsawant5432]

Everything after tesla is unlikely to happen 😂😂😂

[@aakashyadav6228]

@@pranavsawant5432 😂😂

[@codewithshalvi8163]

😂

[@adityavamsi12]

It should be like it's 2050 but still if anyone want to study DP...They come here❤️❤️❤️

[@aayush5474]

Some questions we dont have answers to: Bermuda Triangle... Dark Matter.... 27th video...

[@tanmaykumar4784]

we want the 27 th

[@atanumahapatra6510]

@@Harish-fx2mo #BringBack27thVideo

[@anmolsharma9539]

@@atanumahapatra6510 what is the topic of 27th video??

[@AshishKumar-lx1fv]

@@anmolsharma9539 Palindromic Substring

[@ANKRITIPANDEYCSE--]

@@AshishKumar-lx1fv how do you know that? I wanna learn this power.

[@mihirdesai1083]

Your methodology to explain the base problems in depth and then applying it again in other similar problems by finding the pattern is so extraordinary, I've figured this question by myself now! Thanks man, these resources are the sacred texts! Great effort man, hats off.

[@simranpreetsingh3052]

Brother, I am so much thankful for you that you made these concepts so clear and easy. Your unique way of teaching and linking problems with previous problems makes it so much interesting to learn DP.

[@rudeboyforu]

Bhai, this is pure gold! This has made me fall in love with programming. Not enough words to compliment your teaching skills.......Thanks for this tutorial

[@sarcastic_army]

Playlist too great to doubt yourself!!!!!!!!!!

[@avikmallick2493]

Bro, your concept building is so good that for last few problems I am able to solve the problems within 2 minutes before watching the videos

[@Pratik-Kedar]

DP to bohot sikhli , CAN WE HAVE VIDEO ON HOW TO SPIN PEN?? :)

[@prithviraj8801]

Bro the way u taught from beginning is awesome..now the moment you explain the question i am able to figure out the pattern . And it bcz of u.. no words to describe how great you are

[@shubhamjaiswal7645]

now i can tell that the best sequence and way to learn dp is from your playlist ....your pedagogy is just phenomenal ....literally hats off .....another best dp playlist is of babbar bhai ....4 techniques to optimize the code taught by him is also mind blowing

[@Vishal-nc8ju]

I solved this question before seeing the solution by your previous concepts and explanation

[@anandsharma5850]

same

[@ashutoshyadav9881]

same just 10 sec i click

[@hithardhksvln5302]

I have been following your playlist. Just after starting a video and lisitening to problem statement I was able to put my pen on paper and able to get answer before completion of your explination.All credits to you sir Aditya Verma. I feel some what confident in DP rt now .Thanks for the videos.

[@decentralmultiverse6719]

Awesome content!! I found one pattern also if the question was minimum no. of insertion(anywhere) to make a palindrome, the answer remains same :)

[@baravkarnishithjagdish-iii5945]

great insight

[@RandomShowerThoughts]

yup exactly, I did the question now and it makes sense. We can find the subsequence, and then for each remaining character, we can just add it to one side of the string, and a copy of that string in the other to ensure that it's always a subsequence

[@satvik1489]

Thank you very much Aditya sir for this wonderful series on DP. I was able to solve LCS questions before watching the video. All the credit goes to your beautiful teaching style that focuses on concept and not on final solution. 🙏

[@manishakanyal751]

omg, after doing so many questions of dp explained by you, I am finally doing it on my own! credits go to you! Thanks, man.

[@vinayaksangar1928]

The question can be viewed as dividing a string into two (sub-sequences) such that first is a palindrome. What is the minimum size of the second subsequence. The size of the second subsequence is the number of deletions required. Also to minimize the deletions (hence the size of second subsequence), we need to maximize the first subsequence ie longest palindromic sub sequence. Ex: S = agbcba is broken into two subsequences {abcba} {g}

[@galleryofjatin19]

bhai hard level ke question horhe hai ab asani se dekhte hi smjh ara hai ki kya lgna hai is question mae! BIG thanks to you brother

[@zeeinna]

I never thought that how easily I can solve DP questions just watching these videos. These are just amazing. Hats off to its maker.

[@rhishishrivastava675]

koi hai jo camera k peeche se DP ka game badal deta hai. Huge Thankyou to u dude :)

[@pradeepmehra6879]

bhai your videos are really easy to comprehend. Helped me a lot during my interview preparations. Thanks

[@amulyaponnuru2173]

u are just awesome...the way u r teaching is making us think more and now, I am able to think of the procedure without seeing the solution in the video...thank you soo much bhaiyyaa

[@myaccount09011975]

Bhai, you are real gem!. Please do similar series for other Algorithms Greedy, Divide and Conquer, Backtracking etc.

[@praveenkumarsingh8427]

No-one : What do we say to the god of Dynamic Programming? students : thank you, Aditya verma

[@AnshuKumar-zn1qb]

Bhai aag lga diya aapne 🔥🔥🔥🔥🔥🔥🔥Dp ko kyahi padhaya h aapse best koi nai h dp ke liye..

[@Vishal-ds6ly]

I just love this series solved this question before playing video. Hats off to you man.

[@Npanywayme]

Apki video Placement ki majburi me suru kiyethe ,..Paar aab maja anane laga hai🔥👍

[@pranshusahijwani6313]

Beautiful explanation, especially using previous knowledge. Dude you yourself are an efficient DP Algo!

[@deepugupta8440]

Bhai tu Kya padhata h yaar !!! Next level❤‍🔥

[@atulwadhwa192]

is it 0:29? 1. revesre(a) 2. find lcs(a,reverse(a)) 3.deletion=a.length()-lcs(a,reverse(a))

[@shubhamdudhe673]

I had never seen before, teacher who teaching style makes hard problem is very easy 💯💯💯

[@SurajYadav-py1do]

i have also solved this only reading the question ............thanks bro for amazing concept on DP 🙂🙂

[@ShubhamKshirsagar-m8i]

Amazing explaination !! Aditya . Amazing Inverse Logic !

[@babumon5351]

I don't know how much I have to thank you. I will share this with all my friends.

[@swapnilpadaya163]

Just by reading the title question ka ans mil gaya ❤️ thanks Aditya you are seriously saviour here ❤️

[@jimitshah7636]

bhai chamakne laga hai ab toh!!!🤩💥🔥🔥

[@rahulkhandelwal7034]

Bhaiya bcoz of you I have solved 5 diff questions of dp , when I got AC this time in dp I am very very much happy , I can't tell you . Thank you so much you r a life saver for us ❤️🙏🙏🙏

[@sharuk3545]

finally half playlist done. now I love in DP thnk u aditya thnks alott make plz make more videos

[@anandsharma5850]

same

[@devanshdwivedi6558]

Just a note guys, the Leetcode question similar to this asks for minimum number of additions to make a string a palindrome, the answer is of course the same :)

[@yashshukla1637]

bahut sahi...so easy to build up intuition this way.

[@easysolutions135]

I am HappY and lucky that i can understand Hindi, else i would have missed this Legendary series by Aditya. Thanks Anna.

[@mayur_madhwani03]

Itna sahi samjhaya ki ye queston khudse hi kar liya 😁

[@dinarperseus3332]

Your explanation is always best

[@medamsaisirisha847]

Even without completion of video Im able to solve problems and similar ones on leetcode, thank you so much

[@harsh-govind]

Coded in just 10 sec. Thanks.

[@bite091_jamee7]

Really Really in love with your series man!......really amazing....first i thought u r using only paper and not screen so series won't be good...but it was totally opposite.....u r amazing

[@animearena8443]

read the qn and was able to solve in one go within a minute. wish u taught us the whole dsa 😭😭😭😭

[@jayshree7574]

figured out in the beginning, really thankss to u

[@ajitkumarsingh871]

Find the Length of LPS. Subtract this length from the length of given string

[@niitteenpathak5620]

You are God of Dynamic Programming sir😎😎

[@divakarmishra_3792]

first time i solved any LC hard question only by reading question in one go thank you so much bhaiya

[@devanshmesson2777]

This is just awesome! Thank you so much!!! It is GOLD!

[@RohitGupta-xf3zp]

only one word legend bhaiya🙌

[@KRISHNU10]

I think the 27th video was "Longest Palindromic Substring". It looks like an LCS variation. But there is one case where LCS fails in that problem and gives wrong answer.

[@webdev_telugu]

What is the case that it fails?

[@vasutiwari4187]

@@webdev_telugu We could see that the lcs method fails when there exists a reversed copy of a non-palindromic substring in some other part of String

[@sanjayjoshi8807]

@@vasutiwari4187 can u plz explain this with example bcz I am doing "Longest Palindromic Substring" and kinda stuck bcz I am using same intuition LPSubstring= LCSubstring( string, reverse(string) ) !!!!

[@ashishkatyal]

@@sanjayjoshi8807 suppose the string is "abchjcbf", there is no such palindromic substring of length 2 or more. So the answer should be "a" but following this approach i.e. LPSubstring= LCSubstring( "abchjcbf" , "fbcjhcba" ), it would give answer as "bc" which is the longest common substring here. Hence, it fails.

[@Yogeshyadav-iu4zk]

what a series ...love u aditya bhai

[@monildand4366]

Bhai longest palindromic substring (LPSS) kaisse nikale?

[@priyarathore9266]

Best DP course on internet , free but gold!

[@anubhavjangra9365]

Great work sir. Video main jo bhi ad aati hai kabhi skip nhi krta😅

[@prateekchauhan5376]

feeling so confident after solving this question by myself, thanks a lot for making my base strong, KUDOS

[@Sunny-ri4yo]

Bro why isn't the 27th video available?

[@TheAdityaVerma]

It soon will be !! Till then just bear with me. Apologies.

[@Sunny-ri4yo]

@@TheAdityaVerma bhoolna mt bhai bas.

[@ashishdwivedi5190]

@@TheAdityaVerma Bhai jaldi bana de placement season aane Wala hai....

[@charan775]

@@TheAdityaVerma bhai what happened?

[@sachin2dehury]

@@TheAdityaVerma 27th video

[@8bit_hero850]

Solved it only after reading the question. Thanks for these amazing videos :)))

[@divyanshrawat2859]

another day of bro telling us that we have to defeat only one enemy , others are just his copies .

[@bhaswatiroy1433]

No wonder they call him "The guy who made dp easy"

[@debasNnd9068]

what content is the video number 27, it shows that it is private?

[@shriharikulkarni3986]

Awesome!!! You're just amazing aditya

[@kiefchag5759]

thank you for the video, Best explanation I have seen for this problem

[@akashbajpai593]

BONUS: Minimum number of insertions to make a string palindrome. It's logic is also same as this problem.

[@abhishekhorton79]

I solved this problem just after you said the problem statement just because of you thanks a lot bhaiya ;)

[@neuron8186]

he be llike ' toh hamne kuch naya nahi seekha' me - arrey yaar ye banda kitna awesome hain

[@mohit84604]

javascript code :- let string = "agbcba" // let string1 = "pea" function lcs(st,st1,n,m) { let dp = new Array(n+1) for(let i =0; i

[@jasmeen2541]

You are the best!! Please keep going Can't thankyou enough!❤🙌

[@TheAdityaVerma]

Thank you Jasmeen !! 😅

[@AnkushKumar-mk8ns]

@@adhishmalviya2408 Kab tak rain tapping water jaise question mein paani nikalte rhneg.

[@himanshumalik6913]

Bhaiya Thanks, I just solve this problem by myself looking just watch first 40seconds of your video

[@ParthKanakiya]

Truly amazing videos. Why is the video previous to this one not available?. It says its private in video 27 of the playlist.

[@RithikaVivaram]

best dp playlist

[@Iamnoone56]

Thank you for the playlist!!! learnt a lot..it would be good if you would have mention the Time and space complexities.

[@sushantmahajan5289]

This playlist will soon cross 1M views.

[@KRISHNAKUMAR-yk3tt]

within 30 sec I figured out the solution, that's called an organized way of teaching

[@jainildodia]

I was able to instantly solve this problem based on the hint in the previous problem! Epic stuff @Aditya Verma

[@tejasshaha6629]

God Of DP. Thank you so much for everything Aditya ❤

[@sanidhyasrivastava3816]

Congratulations man..... U got a new subscriber ❤️❤️

[@subodhkamde7784]

Solved this before wathing this video power of aditya verma

[@therationalist6211]

I think the reason why 27th video is missing is that, maybe the video was about Longest Palindromic Substring and it can be done without using DP in O(n^2) time and O(1) space which is better than DP solution which takes extra space.

[@harshsngh07]

cant find the 27 lecture....earlier it was their

[@yuvrajoberoi7834]

What was the question in that video?

[@pranjaltiwari2344]

LODA TE LASSAN

[@lovleshbhatt7797]

@@pranjaltiwari2344 xd.......

[@hey.prernaaaa]

Best content. Sir why is the video previous to this one not available?. It says its private.

[@nehasagar9416]

Great videos...... easily understanding Thank you for teaching us!😊

[@vakhariyajay2224]

Thank you very much. You are a genius.

[@cybertechpcmusic6995]

finally feeling like ive done some progress when i am able to think about solution just winthin a minute.

[@nikhilkumarsingh2082]

sir aap great ho...thank you very much...lots of respect..

[@willturner3440]

Bhaiya is this logic is correct_ Let A be string B be the reverse of A minimum deletion =length of A - LCS of a and b

[@pratyushbhatt1712]

yes

[@datastructure_solved5839]

bhiayya greedy/graph problems ki bhi playlist banao plz

[@siddhantjaiswal5999]

Sir ,Actually this series is best among all !! . now i can think of the solution by my own !! Lots of love sir :-)

[@058__shivamverma7]

just two lines int temp= solver(n,n,str1,str2,dp); return n-temp;

[@tanmaynassa]

37 seconds into the video and I already knew the answer

[@ngtv5608]

Need a playlist on GRAPH !!

[@ayushmishra7729]

Aditya Verma - You are the GOD of DP

[@jayshree7574]

what was the 27th videeo, why privateeeeeeeeeeeeeee :(

[@divineforever8691]

what was u expecting xd

[@sakerirohan3181]

What should one do if we add the clause of replacing , along with delete and insertion , minimum changes in that....