Longest Palindromic Substring

Expand around center: 2n-1 possible centers (n for odd, n-1 for even). Each expansion is O(n) worst case → O(n²) total. Manacher's algorithm achieves O(n) but is complex. DP approach is also O(n²) but uses O(n²) space.