Hello everyone,

I want to invite you to participate in HackerEarth's Code Monk Contest where questions will be based on the topic Disjoint Set Union. It is a 3 hour long contest scheduled on 25th January at 16:30 UTC. To check your timezone, click here.

The link to the contest: Link

The problem set consists of 5 algorithmic tasks with partial solutions allowed — you get points for every test that your solution passes. The problem set has been prepared by me. They have been tested by pulkit_180894 and the editorials are presented by vaibhavjaimini.

Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!

To learn more about Disjoint Set Union — click here.

Good luck everyone! :)

Update: The contest is about to start in an hour.
Update: The contest has started. Good luck :)

Hello Codeforces,

I invite you all to participate in HackerEarth's October Easy on the 1st of October at 10:00 PM IST.

You will be given 6 problems to solve in 3 hours. The problem difficulty will be similar to that of a Div. 2 round on Codeforces. Each problem will be worth 100 points, but partial scoring is allowed so you can try to pass as many tests as you can.

The contest will be rated and will have prizes for the top 5 beginners.

The problems have been set by Himanshu Jaju(himanshujaju) and me(rivudas) and tested by Yury Bandarchuk(Yury_Bandarchuk). I would also like to thank all the Hackerearth admins for their help.

Good luck and have fun.

Edit 1 — The contest has started. Good luck to all.

Edit 2 — The contest is over now.

The top five winners are -
1. Trumen
2. -Morass-
3. 1100011101
4. felix
5. hellman_

Thanks to everyone for participating. Hope you liked the problems. The editorials will be out soon.

Hello everyone,

I want to invite you to participate in HackerEarth's Code Monk Contest where questions will be based on the topic Binary Indexed Tree. It is 3 hour long contest scheduled on 7th October. To check your timezone, click here.

The link to the contest: https://www.hackerearth.com/code-monk-binary-indexed-tree/

The problem set consists of 4 algorithmic tasks with partial solutions allowed — you get points for every test that your solution passes. The problem set was prepared by harshil. I am the tester and the editorials are presented by usaxena95.

Also, top 3 newbie winners to get HackerEarth T-shirts in each Code Monk challenge!

To learn more about Binary Indexed Tree — click here.

Good luck everyone! :)

Edit: The contest has started. Good luck!

Edit: The top 3 winners are: 1. I_love_Tanya_Romanova 2. P_Nyagolov 3. aliasadiiii