Problem Brief

Palindromic Substrings (LC 647 :)

NEW GRADOA

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.

1Example 1

Input

s = "abc"

Output

Explanation

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

Input

s = "aaa"

Output

Explanation

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

Limits and guarantees your solution can rely on.

Draft autosaves locally

public int countSubstrings(String s) {
  // write your code here
}

Input

"abc"

Output