Palindromic Substrings

Try to solve the Palindromic Substrings problem.

We'll cover the following

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\leq 1000

  • s consists of only lowercase English characters.

Examples

Create a free account to view this lesson.

Continue your learning journey with a 14-day free trial.

By signing up, you agree to Educative's Terms of Service and Privacy Policy