the way you implement is really amazing I implemented the same logic for problem D but got WA. it's really cool to see how easily you can convert your logic into a very simple code !!!!!! Thanks for the video
@case3906 Жыл бұрын
21:37 Problem D. Thank me later.
@faiazmahmud6277 Жыл бұрын
Why?? I thank u now
@hritijrana1409 Жыл бұрын
fku @@faiazmahmud6277
@alessiodvt Жыл бұрын
For D I used kosaraju's algorithm for finding the strongly connected components. Maybe a little bit overkill
@implemented2 Жыл бұрын
This is a significant overkill. Notice, how elegant he finds the cycles via removing vertices with zero degree and leaving cycles.
@Entertainmentexe Жыл бұрын
Hey umnik, What is you opinion on Meta not abandoning Competitive Programmers like Google and actually hosting Hacker Cup this year?
@satishshingade3378 Жыл бұрын
when is hackercup
@sarthaksshukla2539 Жыл бұрын
In question D why are longer or shorter cycles bad?
@anandraj-xj5ge Жыл бұрын
Wow ur insane any tips how do u spend so much time sit and practice in ur initial days , solving problems can be fun but sometimes we ll be demotivated, we might have some other works but how do u used to stay consistent
@perkyfever Жыл бұрын
If you sincerely like doing something, you will always find a way and time to do it. Otherwise, don't force yourself to.