How should I practice Count Palindromic Substrings?

Start by reading the full statement, solve the visible examples, then compare the pattern against related The Voleon Group phone screen problems in FastPrep.

Is Count Palindromic Substrings associated with The Voleon Group?

FastPrep tags this as a The Voleon Group phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · String

Count Palindromic Substrings

Learn this problem

● Medium

The Voleon GroupFULLTIMEPHONE SCREEN

Problem statement

Given a non-empty string s, return the number of its palindromic substrings.

A palindrome reads the same from left to right and from right to left. Count substrings by occurrence, so equal text at different positions counts separately. Every one-character substring is a palindrome.

Function

countPalindromicSubstrings(s: String) → int

Examples

Example 1

s = "abc"return = 3

The three one-character substrings are palindromes.

Example 2

s = "aaa"return = 6

The palindromic occurrences are three copies of a, two copies of aa, and one copy of aaa.

Example 3

s = "abba"return = 6

The four individual characters, bb, and abba are palindromes.

Constraints

1 <= s.length <= 2000
s contains only lowercase English letters.