Video Description

Problem: [https://leetcode.com/problems/longest-palindromic-substring/] In this video we will explore the solution for LeetCode question 5, finding the longest palindromic substring using Manacher's algorithm. The time complexity of the solution is O(n). Please feel free to ask any questions you may have. Post a comment under the video or reach out to the Discord server: Discord Community: [https://discord.gg/HUNg7PBX66] Attributions: Gopher Images: [https://github.com/egonelbre/gophers]