Codeforces Round 843 Div 2 | Problem A1 A2 : Gardener And The Capybaras Solution | Newton School

[@KaranMashru]

(Subscribe for more such videos)
Code :
#include
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);

ll t, n, i, j;
string a, b, c, s;
cin>>t;

for(;t--;)
{
cin>>s;
n=s.size();

if(s[0]==s[n-1]){
a=s[0];
c=s[n-1];

b="";
for(i=1; i

[@BobMarley-qh2qs]

really great explanation sir.

[@itachiunichwa2759]

i cant express how much time you save us sir ... hats off!!!

[@ratneshpal6026]

Thank you so much for these editorials sir.

[@lakshsinghania]

sir @9:24 aapne bola ki constrainta ko dekhtw hue 4x10^5 h issiliye O(N²) meh nai jaa sakta
sir mujhe issi meh thoda doubt h like har bar confuse hota hu kaha se padhu yeh contraints wali cheez

[@adnankhan_a_k]

Bro, Luv ki competetive programming ki series refer karlo maine bhi wahi se seekha

[@lakshsinghania]

@@adnankhan_a_k accha , thank u bhai for suggesting

[@ayushnautiyal7965]

Sir Problem B

[@ameygadhe6437]

Rating kya hogi iske sir

[@kannank4269]

Please make editorials in English 🙂 or atleast provide subtitles....🙂