Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You have been given a string STR. Your task is to find the total number of palindromic substrings of STR.

```
If the input string is "abbc", then all the possible palindromic substrings would be: ["a", "b", "b", c", "bb"] and hence, the output will be 5 since we have 5 substrings in total which form a palindrome.
```

```
A string is said to be a 'Palindrome' if it is read the same forwards and backwards.
For example, “abba” is a palindrome, but “abbc” is not.
A 'Substring' is a contiguous sequence of characters within a string.
For example, "a", "b", "c", "ab", "bc", "abc" are substrings of "abc".
```

Detailed explanation

```
1 <= t <= 100
0 <= N <= 1000
Where 't' is the number of test cases, 'N' is the length of the given string.
Time Limit: 1 sec.
```

```
1
abc
```

```
3
```

```
All the substrings of the given string are "a", "b", "c", "ab", "bc", "abc".
The plaindromics substrings are "a", "b", "c". So the output will be 3.
```

```
1
aaa
```

```
6
```