AlwaysACoder's blog

By AlwaysACoder, 4 years ago, In English

Hello Everyone,

We are looking for problem setters on Hackerrank. The problems will be used for interviews and some private contests. You will have a lot to learn in the process. Once you do good with problem setting, we will involve you in other tasks as well like Testing, Statement Review, Editorials, etc.

Since the problems are not for public contests, we follow slightly different guidelines for preparing the problems and hence training new people takes time. Therefore, we will be only taking a handful of new setters.

The compensation will be as follows:

  • Easy — 60$
  • Medium — 80$
  • Hard — 80$

You can assume the following correspondence for the difficulty of the problems in terms of codeforces rating:

  • Easy — 1000-1300
  • Medium — 1400-1700
  • Hard — 1800-2000

Note: We don't need very ad-hoc problems since these problems will not be used to test competitive skills. Also, we discourage problems that are math-based or are based on heavy implementation data structures like Segment Tree, Fenwick Tree, etc. Instead, you can give a problem which is a bit standard but unique. Currently, we have a large requirement for "Hard" problems.

If you are interested in this, please fill the form: https://forms.gle/9kb67EwcgS2JEs3n7.

We will contact you in case you meet our requirements.

  • Vote: I like it
  • +49
  • Vote: I do not like it

»
4 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Is it mistypo, or is the compensation for medium and hard problems the same?

»
4 years ago, # |
  Vote: I like it +53 Vote: I do not like it

heavy implementation data structures like [---] Fenwick Tree

????????

  • »
    »
    4 years ago, # ^ |
      Vote: I like it +46 Vote: I do not like it

    Yes, Fenwick Tree isn't heavy. But you won't expect someone to implement Fenwick Tree in an interview.

»
4 years ago, # |
  Vote: I like it +27 Vote: I do not like it

Still accepting!! AlwaysACoder