Search⌘ K
AI Features

Solution: Palindromic Substrings

Solution: Palindromic Substrings asks you to examine a string and return how many contiguous substrings are palindromes, including single-character and repeated occurrences.

Statement

Given a string, s, return the number of palindromic substrings contained in it. A substring is a contiguous sequence of characters in a string. A palindrome is a phrase, word, or sequence that reads the same forward and backward.

Constraints:

  • 1≤1 \leq s.length ≤1000 ...