Hi everyone.
I want to describe the process to become a problem setter on HackerEarth. I'm eager to see new problem setters want to prepare contests. It's a great experience for every coder to hold a contest at least once. First time when I prepared a contest (I was fifteen that time, a high schooler student!) it was so sweet for me that I continued preparing problems on Codeforces, CodeChef, HackerEarth, Quera, Iran Olympiad of Informatics Finals and several more. Then I worked for 1.5 years in Quera as the contest coordinator, which was great. I'm continuing my job — Contest Coordinating — on HackerEarth from January.
We have three algorithmic contest every month, here is the table:
| Contest | Number of problems | Approximate Difficulty | Length | Comments |
|---|---|---|---|---|
| Easy | 6 | Like Codeforces Div. 2 | 3 Hours | |
| HourStorm | 3 | Easy to Medium-Hard | 1 Hour | |
| Circuits | 8 | One approximate problem and 7 algorithmic, from Very-Easy to Hard | 9 Days | More educational, less competitive, we could use classical problems |
As you can see, we need a lot of problems every month. To propose a problem, follow this instruction:
- Register on Ninja Setters platform. where you can write your proposal.
- I'll check your problem soon. If approved, you should prepare test cases, solution.
- We'll have you in a contest!
Our proposal queue is almost empty, so if you propose a problem today, with a high probability, your problem will be used in August contests. Here is the compensation table:
S. No. | Difficulty level | Indian setters (INR) | International setters (USD) |
1 | Very Easy | 1600 | 23 |
2 | Easy | 2300 | 35 |
3 | Easy-Medium | 3000 | 45 |
4 | Medium | 4700 | 70 |
5 | Medium-Hard | 6000 | 90 |
6 | Hard | 8000 | 120 |
7 | Approx. | 8000 | 120 |
P. S. You don't need to prepare the whole contest. A contest may have many setters, so even if you send one problem, it's welcomed.
P. S. We need an approximation problem every month. Propose it if you have some. Check last Circuits contest for an example.
