Count Palindromes in String | Dataford Interview Questions

Write a function that counts palindromes within a string, counting single-character substrings as palindromes.

Return the total number of contiguous substrings that read identically forward and backward. The input is a string, and the output is an integer.

Function signature: def count_palindromes(s):

0 <= len(s) <= 1000
s contains standard ASCII characters
Count each occurrence of a substring separately, even when the substring text repeats

def count_palindromes(s):

Your question is Count Palindromes in String. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Write a function that counts palindromes within a string, counting single-character substrings as palindromes.

Return the total number of contiguous substrings that read identically forward and backward. The input is a string, and the output is an integer.

Function signature: def count_palindromes(s):

0 <= len(s) <= 1000
s contains standard ASCII characters
Count each occurrence of a substring separately, even when the substring text repeats

def count_palindromes(s):

Your question is Count Palindromes in String. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.