Skip to content

Latest commit

 

History

History
11 lines (8 loc) · 257 Bytes

File metadata and controls

11 lines (8 loc) · 257 Bytes

Problem 8: Maximum Specular Span (Longest Palindromic Substring)

Problem Statement

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

Input Format

  • A string s.

Example

Input: s = "babad"
Output: "bab" (or "aba")