Video

while (j != (n + 1)) { if (sum >= l && sum <= r) { ans++; sum = 0; i = j; } else if (sum < l) { sum = sum + v[j]; j++; } else { sum = sum - v[i]; i++; } } vo isliye kyuki yha code ko dekho .... maanlete hai ki j ekdm last me aagya (n-1) or else if me gya vaha sum me plus hua v[j]... ab vaha hua j increment (j=n) ab agr mene while me likha hota ki while (j != n) to loop aage ni bdhta pr hme chahiye ki vo ek baar or chle kyuki hmne pichle vale iteration me last element ko add kia tha pr check ni kia ki kya ye l or k beech me lie krta h ya ni to isliye.... basically mera sum pehle check horha h or values add baad me horhi h isliye ek iteration or lgrha h taki vo sum ko check kr ske.....I hope smjh aaya ho

@@YSERIESOFICIAL thnku

try krke dekh pehle ho skta h easy pde.... mujhe 2 pointer thoda easy lga

@@nikhilkatoch577 can u share me your code

@@nikhilkatoch577 what will be your answer for abcd bed I think it would be 4+3-2=5 but if we think the answer would be beabcd or abcded this will give length 6... answer is 6

@@dustin4047 yup I guess... But is 5 gnna be the correct answer....

@@dustin4047 sure.... Give me some time

void solve() { ll x, y, z; cin >> x >> y >> z; x++; z--; while (x != y) { if (x % y == 0) { while (x % y == 0) x = x / y; } if (z == 0) { cout << x << endl; return; } ll temp = y - x % y; if (temp <= z) { x = x + temp; z = z - temp; } else { cout << x + z << endl; return; } } cout << 1 + z % (y - 1) << endl; }

@@dustin4047 tnx...vai

mne dekha ki pehle array k elements me mujhe kuch kmi pd rhi hai ... agr vo kmi Puri ho jaye to mera divisible hojaye m se to mene kya kia ki pehle chocolate baat di evenly m=5 bccho me ab meri bchi kuch chocolates hai boxes me unki range kya hogi 0 se leke 4 kyuki agr box me 5 chocolate hui to vo to me baat hi duga. ab ye jo mere pass remainders bcche hai inhe mujhe kahi store Krna hai ki kitne box me kitni chocolates hai... jruri ni map use use ...hm esa bhi kr skte hai ki array lele n size ka fir usme index k according vaha count daal de bchi hui chocolates ka.... or traversing candies array k time dekh lia ki jiski mujhe zrurt hai kya vo mere count vale array me present hai ya ni

still have doubt then tell me

@@dustin4047 Thanks mere bhai for reply

pls tell me where u faced the problem... I'll try to solve here

@@dustin4047 buddy you did great , don't give too much attention to these haters!

@@toshiksharma appreciate that

sure

Send me your code

code please

@@dustin4047 #include <bits/stdc++.h> using namespace std; int main() { int t,n,flag; cin>>t; string s; while(t--) { flag=0; cin>>n>>s; for(int i=0;i<n/2;i++) { if(s[i]==s[n-i-1]) { if(flag==1) flag=2; } else { if(flag==2) { cout<<"NO"<<endl; return 0; } flag=1; } } cout<<"Yes"<<endl; } return 0; }

@@modiyadeepashokbhai5466 just a min

@@modiyadeepashokbhai5466 #include <bits/stdc++.h> using namespace std; int main() { int t, n, flag; cin >> t; string s; while (t--) { flag = 0; cin >> n >> s; int flag1 = 0; for (int i = 0; i < n / 2; i++) { if (s[i] == s[n - i - 1]) { if (flag == 1) flag = 2; } else { if (flag == 2) { flag1 = 1; cout << "NO" << endl; break; } flag = 1; } } if (!flag1) cout << "Yes" << endl; } return 0; }

@@modiyadeepashokbhai5466 bhai vo isliye nhi chl rha tha kyuki no ke baad return zero hone pr vo pura return hi ho jaa rha tha or mere code me chl rha tha kyuki mene ek alg function bnaya tha .... ye rha mera solution alg function me codeforces.com/contest/1789/submission/194929538

Code bhejo