Codeforces Global Round 28 | Video Solutions - A to D | by Pradyumn Kejriwal | TLE Eliminators

[@TLE_Eliminators]

Please fill in the feedback form for PCD: forms.gle/S1QT5aJFLNx1cBtA9

[@divypareek8230]

This explanation is the best , you are great

[@abhinavennala9613]

That was a good proof for the first problem !!

[@vampconnoisseur]

For the kevin and binary strings, firstly i tried to store the xor result in long long to compare it, but the constraints on n are 1

[@divypareek8230]

Thanks I was also stuck at the same point, now I get it

[@sazid1183]

This is really helpful! Thank you so much bro.

[@Sadanand-z6p]

i want e solution please

[@saurabhbunty123]

me too

[@SameerSuman-ni6fz]

solving till A to problem D is enough or shall we solve more of them

[@vishalmishra-ue4te]

Good explanation for C thanks

[@stabgoblin]

My implementation of C was kind of similar but it failed on 2nd test case I think the problem is in xor logic or something, I'll upsolve it now

[@raghavsingla7851]

Use long long instead of int and try again

[@vampconnoisseur]

Long long will also overflow due to the constraints on n, 1

[@stabgoblin]

@@raghavsingla7851 no actually I made a function which counted different bits in both strings which I wanted to compare then I stored it in a map.. I solved that question later :)

[@Anonymous-y7f7u]

@pradyumnkejriwal3007 hey, just wanted to ask are you currently not in India cause your timezone is different? Excellent explanation btw!

[@hardikpatel352]

Explaination for c 🔥🔥

[@italk-gj5kk]

Thanks

[@vibhanshusharma9143]

😶😶 I do everything same to same but just one place do replace 0->1 whole code became mess i quit then 😂😂😂

[@bhavyashah3674]

Prady s D was copied , his contest is skipped😂😂

[@TanmayMankar-26]

I solved c in 0(n)

[@cqwshi]

how?

[@kingbagavathi6056]

I solved it using the sliding window technique as well. 😂

[@TanmayMankar-26]

Bro my technique is newly invented