Leetcode Visualized: 647. Palindromic Substrings

preview_player
Показать описание
Count them substrangs.
Рекомендации по теме
Комментарии
Автор

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

suman
Автор

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

SimoneIovane
Автор

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

prithvirajrathore
Автор

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

YeHenryTian
Автор

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

walidzein
Автор

I am your 400 th subscriber all the best go.

ashutoshgupta
Автор

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

sumitrana
Автор

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

ujjvalsharma
Автор

Excellent Explanation ! looking for more videos from you

manojrajasekar
Автор

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

oneandonlyflow
Автор

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

WhiteSharkconcac
Автор

Super clear, oh my god! best explanation ever!

tuanhvu
Автор

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

kx
Автор

Thank you Alex! It was very detailed solution

sindhukasula
Автор

good strategy. Very easy to understand.

fep
Автор

agree, best explanation and solution !

yingxie
Автор

Someone doing leetcode in typescript finally

rohansood
Автор

Thank you for very clear explanation!👍

akkzhol
Автор

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

yasssh
Автор

great explanation keep up the good work

ujjvalsharma
join shbcf.ru