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 \leq$ s.length $\leq 1000$

• s consists of only lowercase English characters.