Longest Palindromic Substring TUTORIAL (Leetcode #5)

Описание

Longest Palindromic Substring TUTORIAL (Leetcode #5) // Do you know how to find the longest palindrome?

Finding the longest palindromic substring is a classic Leetcode problem. This coding interview question is a great example of how to use dynamic programming as well as several other approaches, like Manacher's Algorithm.

In this coding interview tutorial, you will learn to solve this Google interview question and effectively prepare for your coding interview.


RESOURCES & LINKS MENTIONED IN THIS VIDEO:

Longest Palindromic Substring (Leetcode #5): https://leetcode.com/problems/longest-palindromic-substring/

50 Coding Interview Questions Guide: https://www.byte-by-byte.com/50-questions

[FREE EBOOK] Dynamic Programming for Interviews: https://www.byte-by-byte.com/dpbook

Coding Interview Questions and Answers Playlist: https://www.youtube.com/watch?v=c0OMPDLef08&list=PLNmW52ef0uwsjnM06LweaYEZr-wjPKBnj


YOU CAN ALSO FIND ME HERE

Website: https://www.byte-by-byte.com
Twitter: https://twitter.com/ByteByByteBlog
Facebook: https://www.facebook.com/bytebybyteblog

#codinginterview #leetcode #bytebybyte

https://www.youtube.com/watch?v=b4vgaENSRrY