Leetcode - Longest Palindromic Substring (Python) (Revisited)

preview_player
Показать описание
January 2021 Leetcode Challenge
Leetcode - Longest Palindromic Substring #5
Рекомендации по теме
Комментарии
Автор

I wanted to thank you so much for these videos :) I went from knowing absolutely nothing about DS and algos to passing my interview today. I want to credit my success in part to your videos because your explanations are so splendid. Thanks again!

jolee
Автор

41 seconds of this video helped me solve this one
...you made me realize I was doing everything right, but I was clogging up memory by appending to lists, filtering out the bad and returning the good(which clogs up the memory AKA "time limit exceeded")

nikeboy
Автор

Hi Tim, i think the second loop for j in range(i+1, len(s)) shouldnt have +1?. cuz if it +1, u going to check the 0 position

stockjanitor
Автор

How l and r in the middle when you actually assigned the value 0, 0 to both. They should iterate from the start

ayushbhambore