PROBLEMS|MOD 07|MEDIUM

Longest Palindromic Substring

Lists & Tuples

Implement algorithmic solution for **Longest Palindromic Substring** (Medium level). Input parameters: `data`.

// EXAMPLES

Example 1:
Input: Input: 2
Output: 12
Explanation: Result for example 1 of Longest Palindromic Substring.
Example 2:
Input: Input: 5
Output: 15
Explanation: Result for example 2 of Longest Palindromic Substring.

// CONSTRAINTS

  • 1 <= len(input) <= 10^5
  • Time Complexity target: O(N) or O(N log N)
  • Space Complexity target: O(1) or O(N)
  • Evaluated against 600 test cases.
solution.py