How should I practice Longest Palindromic Substring?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Cisco online assessment problems in FastPrep.

Is Longest Palindromic Substring associated with Cisco?

FastPrep tags this as a Cisco coding interview or online assessment practice problem when the problem catalog has that company context.

Problem · String

Longest Palindromic Substring

Learn this problem

● MediumCiscoFULLTIMEOA

See Cisco hiring insights

Problem statement

Heads up! Original problem is from LeetCode 5. Note that in the original problem, a single character is also considered palindromic, so before printing, you just need to check if the length of the longest palindromic substring is 1. Otherwise, follow the original LeetCode problem as is.

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

Function

longestPalindromicSubstring(s: String) → String

Examples

Example 1

s = "babad"return = "bab"

"aba" is also a valid answer.

Example 2

s = "cbbd"return = "bb"

🦊🦊

Constraints

1 <= s.length <= 1000

s consist of only digits and English letters.