1p3a_oj Question

Find Longest Palindromic Substring

Question Details

Given a string, find the longest palindromic substring. The input is a string consisting of uppercase letters, and the output is the longest palindromic substring. If there are multiple substrings of

Full Details

🔒

Unlock all Cisco questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a cisco interview for a swe role during the coding round.

It covers the following topics: Strings .

Topics