Longest Palindromic Substring

Problem Overview

• Find and return the longest palindromic substring in a given string s.
• Input: string s (1–1000 chars, digits/letters only); Output: the longest palindromic substring; single-character substrings count.
• Domain: string processing and text analysis, a common algorithmic problem.
• Source: asked in Cisco interviews; a classic coding interview interview question.