Palindrome Partitioning II | Leetcode 132 | Live coding session 🔥🔥🔥

preview_player
Показать описание
Here is the solution to "Palindrome Partitioning II" leetcode question. Hope you have a great time going through it.

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 2:30 Solution
4) 8:00 Coding and Time Complexity

For discussion/feedback

PS : Please increase the speed to 1.25X
Рекомендации по теме
Комментарии
Автор

Though I am a C++ guy, the way you explain, make me easy to understand.Thank you so much!!

abumotalebrony
Автор

not able to understand the part of buildMatrix. Can you refer me to your one of the videos, in which you explained it.

killeraloo
Автор

The best answer, the diagrams really explain it well

MrACrazyHobo
Автор

Typical Question. Although completed after watching this. Thanks !

anujchauhan
Автор

Your videos are great. But please fix the sound.

ashishjaiswal
Автор

actually using a really example like "ababbba" would be much better than denotes using x1 x2.

hoyinli
Автор

why are we doing j-i<=2 in the builMatrix func?

sathishtadaka