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
--------------------------------------------------------------------------------------------
Watch video Longest Palindromic Substring | Leet Code | Dynamic Programming online without registration, duration hours minute second in high quality. This video was added by user Lagnesh Thakur 28 November 2022, don't forget to share it with your friends and acquaintances, it has been viewed on our site 2,323 once and liked it 26 people.