Friendly Arrays | Codeforces 1870B Solution | CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)

[@luisrobertoqt3551]

if u have a array a, with [4,2,0] and a array b [3] the maximum following the algorithm is 7, and the minimum is 6 but if we use or in 0 and 3, we got the array a [4,3,2] who has a xor of 1. why is this possible? i saw another's codes solutions that got acepted but i can't understand why that's the optimal algorithm. (the problem states that the elements of the array can be 0)

[@kapishupadhyay2026]

your explanations are clear and understandable , I wish for your growth on youtube

[@VivekYadav-uy9ts]

again, i'm here what was the approx. rating of this problem?

[@codingdynamo]

Unable to predict, even if the rating is low. Sometimes the problem is difficult and vice versa. Let's wait and see.

[@OnlyAyushAgarwal]

Nice explanation bro

[@nolove5480]

very nice explanation

[@codingdynamo]

Thank you

[@md.saifulislam8710]

Your Writing explain fully not clear , Please clearly step by step explain ! But your code easily understand . Thank you!

[@codingdynamo]

Thanks for the feedback. Will take good examples and improve next time.

[@1braincellremaining165]

great

[@16_arpittiwari49]

Hey dynamo,need C plz😮‍💨 and congo for 1k

[@codingdynamo]

Thank you so much for the kind wishes😊❤️ Solution for C uploaded 👍

[@muhammadosamafahim7019]

Sir app gum gata ho yrrr bss videos bnata rha kro yrrrr bht seekhna ko millta hae aur explanation bhi isi trhan detailed rkha krein bht shurkia

[@codingdynamo]

Thanks will keep it going, also, gum gata means ? 😅

[@muhammadosamafahim7019]

@@codingdynamo mtlb Kuch dinon ka Liya beech mei apki videos ana bnd hogati to you are missed sir

[@gentleman7060]

Bad explanation

[@codingdynamo]

I understand, will try to improve. Anything you feel can be done better ?