Longest Palindromic Sub-string (LeetCode 5) | Full solution with examples | Study Algorithms

👉 👉 Super helpful resources available here: https://nikoo28.github.io/all-my-links/

To see more videos like this, you can buy me a coffee: https://www.buymeacoffee.com/studyalgorithms

Longest Palindromic Substring is a programming challenge on LeetCode. A palindrome is a type of string that reads the same when reading left to right and right to left. An example of a palindrome can be “level”, “racecar”, “kayak” etc. Given a string, find the longest palindromic sub-string. You need to return just one string, and the characters should be contiguous. Watch the video to understand the problem in a simplified manner. I then work along with you to solve it first using a Brute Force approach, and then an efficient approach. All along with visuals and explanations.

00:00 - Intro
01:40 - Problem Statement and Test Case
02:58 - Brute Force Solution
03:45 - Efficient Solution
05:41 - Dry-run of code

📚 Links I talk about in the video:
Actual problem on LeetCode: https://leetcode.com/problems/longest-palindromic-substring/
Code on Github: https://github.com/nikoo28/java-solutions/blob/master/src/main/java/leetcode/medium/LongestPalindromicSubstring.java
Test cases on GitHub: https://github.com/nikoo28/java-solutions/blob/master/src/test/java/leetcode/medium/LongestPalindromicSubstringTest.java

📘 A text based explanation is available at: https://studyalgorithms.com/string/longest-palindromic-substring/

To see more videos like this, you can show your support on https://www.buymeacoffee.com/studyalgorithms

💻 Get Social 💻
Follow on Facebook at: https://www.facebook.com/studyalgos
Follow on Twitter at: https://www.twitter.com/studyalgorithms
Follow on Tumblr at: https://studyalgos.tumblr.com/
Subscribe to RSS feeds: https://studyalgorithms.com/feed/

#leetcode #programming #tutorial