Palindrome Substrings

Given a string STR, your objective is to determine the total count of palindromic substrings within it.

Input:

The first line contains an integer 't', the number of test cases. Each subsequent line consists of a string 'STR'.

Output:

For each test case, output the total number of palindromic substrings of the given string on a new line.

Example:

If the input is:

abbc

The output should be:

5

Explanation: The palindromic substrings are ['a', 'b', 'b', 'c', 'bb'].

Constraints:

  • 1 <= t <= 100
  • 0 <= N <= 1000 where 'N' is the length of 'STR'.
  • Time Limit: 1 sec.

Note:

A string is considered a palindrome if it reads the same forwards and backwards.
AnswerBot
2d

Count the total number of palindromic substrings in a given string.

  • Iterate through each character in the string and expand around it to find palindromic substrings.

  • Use dynamic programming to optimize ...read more

Help your peers!
Add answer anonymously...
Sourcefuse Technologies Software Developer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter