Given a string s, return the longest palindromic substring in s.

Overview The Longest Palindromic Substring problem involves finding the longest contiguous palindrome within a given string. A palindrome is a sequence of characters that reads the same backward as fo