A string is said to be a special string if either of two conditions is met:

• All of the characters are the same, e.g. aaa.
• All characters except the middle one are the same, e.g. aadaa.

A special substring is any substring of a string which meets one of those criteria. Given a string, determine how many special substrings can be formed from it.

Example

contains the following special substrings: .

Function Description

Complete the substrCount function in the editor below.

substrCount has the following parameter(s):

• int n: the length of string s
• string s: a string

Returns
- int: the number of special substrings