How should I practice Find 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 Find 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

Find Longest Palindromic Substring 🌼

Learn this problem

● MediumCiscoINTERNOA

See Cisco hiring insights

Problem statement

The input consists of a string inputStr, representing the given string for the puzzle.

From the given string, print a substring which is the same when read forwards and backwards.

Note

If there are multiple sub-strings of equal length, choose the lexicographically smallest one.
If there are multiple sub-strings of different length, choose the one with maximum length.
If there is no sub-string that is the same when read forwards and backwards print "None".
Sub-string is only valid if its length is more than 1.
Strings only contain uppercase characters (A-Z).

Function

longestPalindrome(inputStr: String) → String

Examples

Example 1

inputStr = "YABCCBAZ"return = "ABCCBA"

Given string is "YABCCBAZ", in this only sub-string which is same when read forward and backward is "ABCCBA".

Example 2

inputStr = "ABC"return = "None"

Given string is "ABC", and no sub-string is present which is same when read forward and backward. So, the output is "None".

Constraints

Unknown for now