Longest Palindromic Substring
Return the longest substring of a string that reads the same forwards and backwards.
Progress cannot be saved in this browser, so completed lessons will reset when you leave.
Lesson notes
Try it before you watch
Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.
Reveal the key idea
Every palindrome has a centre. Expand outwards from each of the 2n − 1 centres (characters and gaps between them) and keep the longest match.
Pattern: Two pointers & sliding window. Move two indices through a sequence so each element is visited a constant number of times.
Complexity
| Measure | Bound |
|---|---|
| Time | O(n²) |
| Extra space | O(1) |
Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.