Package g0601_0700.s0647_palindromic_substrings

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    647 - Palindromic Substrings.

    Medium

    Given a string s, return the number of palindromic substrings in it.

    A string is a palindrome when it reads the same backward as forward.

    A substring is a contiguous sequence of characters within the string.

    Example 1:

    Input: s = "abc"

    Output: 3

    Explanation: Three palindromic strings: "a", "b", "c".

    Example 2:

    Input: s = "aaa"

    Output: 6

    Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".

    Constraints:

    • 1 <= s.length <= 1000

    • s consists of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer countSubstrings(String s)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait