D. Secret Santa | Codeforces Round

[@KhemendraBhardwaj]

Does there exist some sort of dfs based approach by constructing a graph, like calculting the longest assinging chain such that if u-> v , v is not assigened early

[@madmax2442]

Best explanation and great logic! Thanks a lot.

[@adityasingh7288]

6 number ladki h 😂

[@anujagrawal1036]

bhai ek discord server ka link?? Problem Discuss kar sakte hai whaa par

[@kirtipalve1772]

Thank you!

[@ishmam8643]

Really nice explanation bro.

[@amanchoudhary4801]

yaar ye edge case bahut prasan karta hai

[@5590priyank]

nice

[@anweshakumar7838]

👌👌👌👌👌

[@vibhashkumar5554]

C upload kijiye