We are currently looking for an experienced, self-driven, and curious Programming Problem Setter to join our passionate and innovative team. You will have the freedom to provide meaningful insights and explain data models to our clients is appetizing.

At HackerEarth, we also boast of a strong community of Programming enthusiasts who have been nurtured through different initiatives. 

Location: Bangalore (Hybrid) - MUST
Duration: 6 months (Extendable)

Roles and responsibilities

• Problem setting team at HackerEarth creates new questions for public/private hackathons/challenges and for our technical assessment product
• Create problems around data structures, algorithms, maths across various difficulty levels.
• Create real-life programming questions and test problems created by other problem setters.
• Test problems created by other problem setters
• Review HackeEarth's existing question bank for technical errors (if any) and ensure that they follow suitable guidelines
• Add code stub (partial codes) to code editor of the problems which helps candidates to focus on writing the logic part for solving that particular problem rather than syntax
• Respond to queries/suggestions/issues from candidates solving problems on HackerEarth platform.
• Work closely with the tech doc team to remove context or grammar ambiguities from questions.

 Required skills

• Excellent knowledge of data structures, algorithms, and maths.
• Excellent profile on some of the online judges (HackerEarth, HackerRank, Codeforces, Codechef, SPOJ etc.)
• Candidates with experience in creating or testing problems for online Judges will be preferred.

We would love to hear from you if you like to code/hack in your spare time and have a knack for optimization. If you’re looking for an outstanding opportunity that you can really make your own, we would love to hear from you. In return you can look forward to being part of one of the coolest and fastest growing startups in the country offering outstanding professional growth and a healthy work culture.