Find the longest palindromic substring

A string manipulation problem that tests algorithmic skills and understanding of substring searching techniques. Typically solved using dynamic programming or expand-around-center approaches, with solutions ranging from O(n²) to more optimized implementations.