Codechef Internship Test

abc1233 · October 26, 2020, 6:30pm

May be a good problem for you to practice FACTRE

samarthsamehi · October 26, 2020, 6:41pm

This post was flagged by the community and is temporarily hidden.

sudipandatta · October 26, 2020, 6:43pm

433/500 couldn’t debug D. Still can’t find the bug. used binary lifting.
Can anyone help debug- UJ8QuW - Online C++0x Compiler & Debugging Tool - Ideone.com

samarthsamehi · October 26, 2020, 6:47pm

This post was flagged by the community and is temporarily hidden.

samarthsamehi · October 26, 2020, 6:50pm

This post was flagged by the community and is temporarily hidden.

samarthsamehi · October 26, 2020, 6:53pm

This post was flagged by the community and is temporarily hidden.

samarthsamehi · October 26, 2020, 7:08pm

This post was flagged by the community and is temporarily hidden.

akshitm16 · October 26, 2020, 7:09pm

You might want to read this .

samarthsamehi · October 26, 2020, 7:19pm

This post was flagged by the community and is temporarily hidden.

saurabhshadow · October 26, 2020, 7:21pm

Most of them solved all.

guddu_pundit · October 26, 2020, 7:59pm

There’s an edge case when both nodes lie in same path

nemesis3733 · October 26, 2020, 8:10pm

Nope there isn’t

ashish_kaur · October 27, 2020, 1:39am

@admin can you please move the problems to Practise section.

shark_wizdmt · October 27, 2020, 1:44am

Can anyone send in some source which explains calculating diameter of a graph.

adyyyy · October 27, 2020, 2:13am

I also solve all .

abhishek1152 · October 27, 2020, 2:14am

Search for two bfs method. It’s pretty straightforward IMO.

rohanxyz · October 27, 2020, 2:19am

Hey any idea when the results will be declared?

shark_wizdmt · October 27, 2020, 3:02am

khushal69 · October 27, 2020, 3:25am

I solved all, but like I was super sleepy so it took me 3.5 hours to solve them all lmao, easy stuff tho, and no I didn’t binary lift, I used segment tree on euler tour

dplyr · October 27, 2020, 4:04am

Looking at the posts, it seems that most of the people solved all . So they may select only those candidates who solved all 5. Which means I have no chance, because I could only solve 3.