Problem: Longest Palindromic Substring

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

Note: If there are multiple valid palindromic substrings of the same length, return any of them.

Constraints

• $1 \leq$ s.length $\leq 1000$

• s consist of only digits and English letters.