Palindromic Substrings at Netskope
Medium72.5% acceptance
This problem has 100.0% frequency at Netskope.
Problem Description
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.
Read full problem and hints