A. String Building
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstring>
using namespace std;
const int N =1e5+10;
int t;
string a;
int main()
{
cin >> t;
while(t--)
{
cin >> a;
bool st=false;
for(int i=0;i<a.size();)
{
int j=i+1;
while(a[i]==a[j]) j++;
if((j-i)==1 && !st)
{
cout << "NO"<<endl;
st=true;
}
i=j;
}
if(!st) cout << "YES"<<endl;
}
return 0;
}
B. Consecutive Points Segment
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N=2e5+10;
int a[N];
int main() {
int t;
cin >> t;
while (t--){
int n;
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
int sum = a[n] - a[1];
if (sum - n + 1 > 2)
cout << "NO\n";
else
cout << "YES\n";
}
return 0;
}