Python Programming Practice: LeetCode #5 -- Longest Palindromic Substring

preview_player
Показать описание
This episode of Python Programming Practice shows two approaches to LeetCode #5 -- Longest Palindromic Substring

This is a medium difficulty problem.

Note that the intent of this series to help viewers think through approaches to problems, not to provide copy/paste access to code that will pass LeetCode tests.
Рекомендации по теме
Комментарии
Автор

Very well explained. Very useful. Thank you very much.

shashikantdivekar
Автор

Loved it. Keep doing, waiting for more...!

MiravMehtaishere
Автор

Nice explanation. The only confusion I have is that while you rightfully mention, we need to handle the odd and even case.

I am just a bit confused, there does not seem to be an if condition to differentiate if we are in an odd or even scenario and it seems that we just run the odd and even case regardless ... I feel like I do not grasp that part properly.

shawnfrank