Longest Palindromic Substring | Leet Code | Dynamic Programming
In this video, we will solve Leet Code problem 5, finding the longest palindromic substring of a string.
This is a follow-along video with live coding.
We will be using Dynamic Programming to easily detect palindromes.
You can connect with me at -
/ lagneshthakur
/ lagneshthakur
Thumbnail art by -
https://amrita-singh.com
--------------------------------------------------------------------------------------------
✨ CHAPTERS ✨
00:00 - Intro
00:25 - What is a Palindrome?
01:40 - Dynamic Programming
04:03 - DP - Boolean Table
19:40 - Code Solution
20:54 - Outro
--------------------------------------------------------------------------------------------
On this page of the site you can watch the video online Longest Palindromic Substring | Leet Code | Dynamic Programming with a duration of hours minute second in good quality, which was uploaded by the user Lagnesh Thakur 28 November 2022, share the link with friends and acquaintances, this video has already been watched 2,346 times on youtube and it was liked by 26 viewers. Enjoy your viewing!
