Tag Archives: HackerEarth

bfd5f9d4-8-cover-AL--R3

Invitation to India Hacks 2015, Qualification Round 3

Hello!

I want to invite all of you to participate in the last Qualification Round of India Hacks 2016, which is organized by HackerEarth.

This is the third and the last one qualification round. If you missed or didn't qualify in the two previous rounds, this is the last change to advance to the semifinals.

Qualification Round 3 takes place on January 17, 04:30 PM CET (click to check your timezone). Top 1000 participants with non-zero score will advance to the main contest.

The prizes in India Hacks are quite nice, including a trip to San Francisco, many tech gadgets and a lot of goodies for top 50 participants. If you want to grab any of them, or you just like to compete agains a lot of other programmers and you haven't qualified to the main contest yet, reserve a time slot for this round!

Screen Shot 2016-01-16 at 9.22.22 PM

I'm a tester of the problem set and a conductor of the contest. There will be 5 problems in the contest and you'll have 3 hours to solve all of them. In addition, a partial scoring system will be used in all of them, which means that you'll get points for each correctly solved test file in any problem.

Big thanks to tanujkhattar, subway, aditya1495 and hellgeek for creating the problems, to belowthebelt for technical assistance and to I_love_Tanya_Romanova and Errichto for proofreading and solving the problems, and for all their suggestions.

Since this is the last qualification round, problems won't be very hard, so if you're going to participate, you may assume that submission time might be a big factor in the final standings.

As a small hint, I can tell you that you should be prepared with number theory, computing optimal subsequences of some types, and techniques used with computation on trees.

Have fun and good luck to all of you!

See you on the leaderboard, hopefully at the top of it :)

61e61b94-8-cover (30)

December Easy 2015 by HackerEarth

Hi all,

December Easy Contest by HackerEarth is taking place on December the 3rd at 5:00pm CET. Contest duration is 3 hours.

There will be 5 problems to solve, all algorithmic ones, especially targeted for beginners. However, I'm pretty sure that any participant will find them interesting to solve :) All the problems have partial scoring and ties are resolved by penalty time.

A little hint for you, 3 of the 5 problems will ask you to minimize some value, so be better prepared with methods of solving these kind of problems :)

As the tester and editorialist for the contest, I want to thank the problem setter aditya1495 and admin belowthebelt for preparing the contest. It was nice to work with you guys as always!

As a tradition in Easy Contests, the top 5 beginners (1st year or 2nd year) will receive HackerEarth T-shirts.

Good luck and see you on leaderboard!

5b70f072-6-cover (25)

November Easy on HackerEarth

On every 1st day of a month, HackerEarth hosts a special contest. It is called an Easy Contest, because it is targeted especially for beginners. However, it does not mean that there are just easy problems to solve, not at all!. This time, the problem set is prepared by shef_2318 and tested by Kmcode. I write editorials, as I usually do for this contest.

The contest is available here: November Easy 2015

There is something special about the contest. This time, problem set contains two unusual problems to solve. They are  completely different than any standard algorithmic problem, so we expect a very nice competition and we are curious how will participants deal with these problems. In addition to these special problems, you will get a chance to solve one problem defined on a tree, decide who has a winning strategy in a special game, and solve two problems targeted for beginners.

See you on leaderboard!

Screen Shot 2015-10-04 at 3.32.28 PM

ACM ICPC Practice on HackerEarth

HackerEarth ACM ICPC Practice contests starts in just under 2 hours. If you are preparing to any ICPC contests, this is a nice challenge for you.

The problem set is prepared by FatalEaglememset123shef_2318xennygrimmato,
sokolov, tanmaysahay94 and me.

Also, it was very nice to work again with Bohdan aka I_love_Tanya_Romanova, who tested all the problems and helped me with writing editorials to all of them.

There are 11 problems in the contest of varying difficulties, but they are rather easier than on official such contests. Make sure to look at all of them!

UPDATE:

My editorials in PDF are available here

My article for HackerEarth Codemonk

HackerEarth just published my first article prepared in purpose of Codemonk series.

This article is a comprehensive tutorial to the most basic graph algorithms, especially useful if you want an overview of the shortest paths problem. In addition, I explained topological sorting also, which is a great property of directed acyclic graphs.

The article is available here: Codemonk: Graph Theory Part II