LeetCode #5: Longest Palindromic Substring

preview_player
Показать описание
A step-by-step visualization to #LeetCode question 35: Longest Palindromic Substring
0:00 Problem Overview
0:25 Brute Force Solution
1:25 Improved O(n²) Solution
3:08 Code Walkthrough
7:49 Note on Manacher's Algorithm

#coding #programming #algorithms
Рекомендации по теме
Комментарии
Автор

I found your video through the description window in LeetCode and I am astonished by the quality of your work. Cheers!

alperenakbas
Автор

bro till now in my life i followed neetcode solution, today i was not satisfied for his solution and hopping to drop this problem but by chance leetcode recommended your solution and i am totally astonished by your explaination and you are doing great work brother keep it up ❤❤

karthikknavalli
Автор

Best explanation for this question in youtube !!!

srinivas_reddy
Автор

Concise, clear to visualise and understand.

mailsiraj
Автор

very clear explanation ..keep up the good work !!! Thanks

shouryaa
Автор

Thank you a lot man. Your explanation with pictures and all stuff moving around helping me a lot. Keep up a good work!😌

poweroffun
Автор

man, you're awesome, thanks for this awesome tutorial

hemantkumar
Автор

I really enjoyed this explanation. Thanks alot!

juliandakwa
Автор

oh, wait, it wants to keep it in the same order smh... I hate leetcode sometimes. I created a solution that will get the longest palindrome, regardless of order, using the chars provided.

raffitchakmakjian