Codeforces Round 721 Editorial for Problems A,B,C,D with hint for E

[@ankithreddyadudodla7673]

Thanks, Bhaiya, I learned a new thing in problem C from this video, The idea of storing the same number indices using the map

[@pranjal5712]

please make videos like this for all upcoming cf contests

[@Gaurav-zh4pm]

❣ thank you again bro

[@reversesweep4211]

I am facing a problem. Let me explain what i want to know, like in morning/evening i gave a virtual, i did 3 problems, now i should try 4th problem. But in editorial it's shows that this problem required dp/graph, now i have no idea about them. So in those small time, like 1/2 hrs, how i can learn those & upsolve that problem? That's the problem I am facing nowadays, learning medium-hard topic vs solving problems daily. What's your suggestion?

[@hitesh6856]

Utkarsh Gupta has taken a lot of classes covering various topics like segment tree, graph, dp, dsu, and more that are 1/2 hours long, I have learned a lot from his classes. I'd recommend you to watch his classes that are available in unacademy for free. unacademy.com/@healthyug . I am so grateful to him for everything he does for us.

[@kunalnayyar9417]

Just because Bob only had a pretty easy condition of the number of zeroes being even, in my solution i put that in if and let else handle the other exceptions

[@utkarshnimje]

Bhai Utkarsh, itna sab soch kaise lete hai log time par!??🙄

[@uppuabhinav9938]

thanks brother

[@chinmayrahate693]

Hey Utkarsh can you make a video on what topics in cp.you should know to become CM on codeforces and how to practice?

[@tushar1949]

Yes it would be very helpful. But from personal experience I can tell you that problems till D requires u to know hashing , dp, two pointers, binary search, trees (and sometimes graph on problem D).. These are the most recurring topics but the questions which require observation you only get better with practice!

[@chinmayrahate693]

@@tushar1949 Ty

[@AtrangiEngineer]

good job sir

[@prabhavsrivastava2629]

unrelated and out of the blue but what keyboard do u use xD ??

[@jaideeppyne1880]

what digital pad are you using? for writing

[@javitritiwari9538]

In the first problem find the nearest 2 power you can just floor(pow(2,floor(log2(n)))) and our ans is just one short of that. How did it click to me ? Well we know that n&(n-1) checks whether n is a a 2th power or not.

[@diploma2007]

this can be written as (1

[@alaymehta2449]

B2 was harder than C

[@yuktikumari6042]

Channel Name Changed

[@utkarshgupta9858]

yeah been over a month since i changed it i guess

[@kabilanm9206]

In B1, if the string is 11111 then it will be draw right?.. Becoz both will spend 0!!

[@abhinavarora7879]

it said atleast one 0

[@jaywagner3934]

Lulz

[@kabilanm9206]

@@abhinavarora7879 oo..okay 😊

[@kuldipkashyap1172]

recommend c++ books for beginner

[@siddhartha166]

We basically want more content like 😅

[@siddharthsharma9829]

Orz

[@harshittiwari3223]

Kya be BUJUS kya hal🤣🤣

[@utkarshgupta9858]

arree sir aaaap🤣

[@harshittiwari3223]

@@utkarshgupta9858 🤣🤣fumll utube baazi bhaiya lage rho

[@Aditya-rp1lr]

reduce the size of face cam, its covering a lot of area

[@Aditya-rp1lr]

@@AyushGupta-mm4jg tum kartik arora hi ho na?