How should I practice Longest Palindromic Substring?

Start by reading the full statement, solve the visible examples, then compare the pattern against related eBay phone screen problems in FastPrep.

Is Longest Palindromic Substring associated with eBay?

FastPrep tags this as a eBay phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · String

● Medium

eBayFULLTIMEPHONE SCREEN

Given a string s, return its longest contiguous substring that reads the same from left to right and from right to left.

If more than one longest palindromic substring exists, return the one whose first character appears earliest in s.

longestPalindrome(s: String) → String

s = "babad"return = "bab"

Both bab and aba have maximum length three. The earlier one is bab.

s = "cbbd"return = "bb"

The two middle characters form the unique longest palindrome.

s = "forgeeksskeegfor"return = "geeksskeeg"

The ten-character middle substring is palindromic and no longer substring is.

1 <= s.length <= 2000.
s contains only uppercase English letters, lowercase English letters, and digits.
Character comparisons are case-sensitive.