# Special String Again

### Problem Statement :

```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.

Function Description

Complete the substrCount function in the editor below. It should return an integer representing the number of special substrings that can be formed from the given string.

substrCount has the following parameter(s):

n: an integer, the length of string s
s: a string
Input Format

The first line contains an integer, n, the length of s.
The second line contains the string s.

Constraints

1  <=  n  <=  10^6 .

Each character of the string is a lowercase alphabet, ascii[ a -z ].

Output Format

Print a single line containing the count of total special substrings.

Sample Input 0```

### Solution :

```                        ```Solution in C++ :

In   C ++ :

#include <bits/stdc++.h>
using namespace std;

int main()
{
int n,c,i=0,j,ans=0;
cin>>n;

string s;
cin>>s;

int same_char_count[n]={0};

while(i<n) {
j=i+1,c=1;
while(j<n && s[i]==s[j]) {
++j,++c;
}

//total substrings which have all same char(s)
ans+=(c*(c+1))>>1;
same_char_count[i]=c;
i=j;
}

for(j=1;j<n-1;++j) {
if(s[j]==s[j-1]) {
same_char_count[j] = same_char_count[j-1];
}

//odd length substr(s) which has middle element diiferent
if(s[j-1]==s[j+1] && s[j]!=s[j-1]) {
ans += min(same_char_count[j-1], same_char_count[j+1]);
}
}
cout<<ans<<endl;

return 0;
}```
```

## Down to Zero II

You are given Q queries. Each query consists of a single number N. You can perform any of the 2 operations N on in each move: 1: If we take 2 integers a and b where , N = a * b , then we can change N = max( a, b ) 2: Decrease the value of N by 1. Determine the minimum number of moves required to reduce the value of N to 0. Input Format The first line contains the integer Q.

## Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

## Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.