I want to prepare CS core subjects quickly for interviews and OAs.
I just want to know if the tuf+ core subject lectures are somewhat decent and not a complete waste of money.
I know that most of the topics are available on the internet for free but its mostly gate/college syllabus oriented which I have already covered for college exams.
I want to prepare CS core subjects quickly for interviews and OAs.
I just want to know if the tuf+ core subject lectures are somewhat decent and not a complete waste of money.
I know that most of the topics are available on the internet for free but its mostly gate/college syllabus oriented which I have already covered for college exams.
Take yesterday’s contest problem D for example (round 1100 Div.1 + Div.2). Why would anyone think this is a binary search on answers problem? The only clue i can see is that it’s a maximise the minimum problem.
And also the trick to convert to a binary array that the editorial shows. Is that a common concept for binary search problems?
I don’t understand what my initial thought process should have been for this problem.