#Leetcode

[@abhishektripathi3904]

Saw your "Longest Palindromic Substring" video an year ago and was able to solve this question today for leetcode POTD all by myself as both have almost similar approach. Thank you so much!!😄

[@sidharthdhiman4522]

one of the best explanation ever i found out for this queisons , thanx for this one di, i was never able to understand this diagonal filling of table , you explain in a very amazing manner , thanx

[@amanchoudhary9107]

Your explanations are awesome, watched a few videos of your on trees and those were great.Thanks for making videos.

[@vaibhavsrivastava7451]

thank you so much maam .. first time i understand such dp concept of coding by visualising very easily ...

[@tsvmanojturlapati4492]

Super Akka ALMIGHTY BLESS YOU WITH ALL KINDS OF WEALTH

[@Imvasusinghal]

Best explanation I've seen step by step. Great work

[@chitradeidanka8633]

love your explanation, you made DSA easy.

[@kunalkheeva]

Its not one of the best, It is the best explanation so far!!

[@suyashajain1952]

Alisha mam hats off to you the explanation was too good keep doing this good work

[@vishnuvardhanreddy4841]

Thank you so much mam .u r explanation is so easy to understand

[@frogloki882]

Weird that you don't have more subs,great video btw

[@divyanshudwivedi3756]

Please make a vedio on the space optimised solution of the above approach.

[@Amit.01]

best explanation... Thankyou ma'am

[@kusumjoshi4613]

I think it will be easier to understand for us if you 1st solve it using memorization

[@md.shihab_uddin]

assalamualaikum mam. from bangladesh

[@prajavi_S]

Just Fab explanation🔥

[@thevijayraj34]

Thanks for explaining this 👍🏼

[@tsug303]

Very good explanation, thanks! Although you seem a bit hasty :)

[@helloworld6208]

you are too good .. Thank you

[@l.paulsonraja4036]

Really a great explanation.!

[@sarthak1409]

All these comments and no one says the title is wrong...the question you solve is not getting the distinct palindromic subsequences but all the palindromic subsequences...hope this is rectified ASAP

[@akhilesh_ku]

Substring*

[@satyamgupta4808]

very very nice explanation

[@KCOYASH]

Thanks for explanation

[@gauravsoni2919]

class Solution { public: int countSubstrings(string s) { int ans=0; for(int i=0;i=0&&r=0&&r

[@KedarBhawthankar]

absolutely not

[@rudrakshtomar8029]

Thank u didi, 2d DP problems are very hard to visualise

[@pankaj_buddy]

Its interesting your father in the video, in another video i have saw your mother.😅😅😅

[@pharthasarathy991]

U really did a great job sis

[@akashonlinehere]

well explained. nice

[@FactToday1]

Awesome 👍

[@ashvinkumhar5819]

great🙌🙌

[@tot7997]

Thanks 😄

[@md.imrankhan6912]

Great

[@nagp2836]

Thanks

[@MrMahgp]

what is the time complexity ?

[@Rajat_maurya]

Thank you

[@hardcash9930]

currently in which company you are working ?

[@souravdas7741]

perfect

[@HARSHKUMAR-be3lp]

aapke abbu aaye the video me

[@HARSHKUMAR-be3lp]

aapke abbu video banana haram nahi mante

[@tot7997]

Jaban di he to kahi bhi hagega kya..

[@HARSHKUMAR-be3lp]

😂

[@rohanbaranwal868]

@HARSHKUMAR-be3lp hagte raho sab padhai hi karega to fir hagega kon😁😁

[@HARSHKUMAR-be3lp]

@@rohanbaranwal868 bhai jyada mt padh lena ki haggu aani hi band hojayee