Leetcode Visualized: 647. Palindromic Substrings

[@SimoneIovane]

The only video that allowed me to understand this damn probelm. Thanks!

[@prithvirajrathore4256]

The best explanation on the youtube so far . can you make a series on dp questions ?

[@suman6327]

Wow what a trick, been struggling on the Palindromic Partitioning problem and found this trick ! Two problems with one solution, thanks a ton !!

[@walidzein1]

i usually don't bother leaving a comment but this explanation is probably the best i've ever seen

[@YeHenryTian]

Dope! I could never think of this solution in a coding interview without seeing it before...

[@divyanshtiwari5540]

Thank you for the vizualization

[@ashutoshgupta2035]

I am your 400 th subscriber all the best go.

[@sumitrana3921]

best explanation!!! I would love to see your channel grow

[@manojrajasekar6035]

Excellent Explanation ! looking for more videos from you

[@oneandonlyflow]

by far the best explanation. I feel like a lot of DP solutions use matrices and this explained why we use matrices rly well

[@ujjvalsharma5055]

Please post more dynamic programming LeetCode problems. You are doing a great job in helping the community

[@chrisgillett8712]

Great vid

[@tuanhvu7036]

Super clear, oh my god! best explanation ever!

[@ice_cube918]

Very good explanation and graphs!

[@fep265]

good strategy. Very easy to understand.

[@leviiiiiiii3019]

You are the best

[@rohansood8848]

Someone doing leetcode in typescript finally

[@WhiteSharkconcac]

Hi, I love your graphical explanation. It makes scary concepts like DP very clear to beginners like me.

[@rohitrai4215]

loved it

[@MhZnSO4]

Great job my man!

[@pavittarkumarazad3259]

This is quality content.

[@yasssh7835]

What a actual fuck! Never seen such a good explanation regarding dp. Thanks mate!

[@kx01]

It's damn the best explanation I have ever come across. :') which I can understand. I never knew dp could be so easy :')

[@Wysking]

Nice explanation!

[@yingxie9974]

agree , best explanation and solution !

[@sindhukasula2560]

Thank you Alex! It was very detailed solution

[@andrejoljaca3577]

Amazing!

[@WowPlusWow]

🙏🏻

[@Jagadish12345]

I followed the same approach and written in Python, getting crrect outputs only but exceeding time limits on submittin in leetcode

[@ujjvalsharma5055]

great explanation keep up the good work

[@henriquebelotto]

Great explanation! Although I'd need to practice a lot to remember this idea! Lol

[@lamrin9178]

Beautifully explained thanks a lot!!!

[@sandeepa4116]

Very well done. I'm just confused with the time complexity. May I know what's the time and space complexity for this?

[@ritikchail7330]

Time complexity is O(n**2) and space complexity is also same

[@xavierelon]

Great explanation. Thank you

[@akkzhol1]

Thank you for very clear explanation!👍

[@yingxie9974]

very smart

[@gepliprl8558]

The explanations is great.

[@ice_cube918]

awesome explanations！

[@rpproductionskenya9012]

I love you.

[@gautammishra96]

very good explanation. Thanks.

[@pm682]

This was super helpful!

[@Davidvideo3]

thx g

[@mythilikarra1902]

How do people just come up with this

[@beinghumanbeing5182]

why did you stop uploading? go ahead

[@conorhynes8633]

Very helpful and clear explanation, what are some other questions in which this apporach can be used?

[@bachxha]

awesome!

[@prajyothalingale7196]

thank you bro....such a great explanation

[@nihanthgajam5194]

well explained

[@pmpiyushmittal1]

This is n^2 solution, can you also make a O(n) solution

[@ianpan0102]

Kind reminder: the count should be initiliazed to s.length instead of 0 (because the diagnals are all 'true')

[@uditasundarray1988]

Good the background music is irritating