My issue
How to find all subarrays of equal 1s and 3s where atleast the frequency of 2 is 1?
My code
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int t;
cin>>t;
while(t--)
{
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++){cin>>a[i];}
ll count=0;
if(n<=2)
{
}
else
{
for(int i=0;i<n-2;i++)
{
vector<ll>v={a[i],a[i+1],a[i+2]};
sort(v.begin(),v.end());
ll su = a[i]+a[i+1]+a[i+2];
cout<<su<<" "<<v[1]<<endl;
if(v[1]==su/3 and su%3==0)
{
count++;
}
}
cout<<count<<endl;
}
}
}
Problem Link: Normal is Good Practice Coding Problem