Codeforces Round 897 | Video Solutions - A to E2 | by Ankit Ghildiyal | TLE Eliminators

[@TLE_Eliminators]

Please fill the feedback for form PCD : forms.gle/3B56Km92A15MmRW87

[@nanthakumarkannan1049]

Please keep posting

[@ramanthakur74]

sir in problem D we can find all vertex which are involved in at least one K length cycle and if there is any vertex which is not involved in any K cycle then ans will be NO else Yes why to make two graph here I don't think no. of strongly connected component needed we can do like count based dfs where if we reaching a vertex again after count as count+k then we will do dfs at that vertax and mark all of its involved vertex as involved and time will not exceed as one vertex can only involved in at max one cycle

[@Bharat_Rider]

21:22 why we added min? While finding max we are already counting those positions in 4

[@shekharsawarni]

Thank you tle

[@space_ace7710]

Thank you............ waiting for this video :)

[@shekharsawarni]

896 ka nhi aya sir

[@shalabhsahu7249]

Yep 896 ka nahi aaega kya?