| Get Ready For Hash Code 2019 |
| Written by Sue Gee |
| Monday, 21 January 2019 |
|
Registration has opened for Hash Code 2019, Google's team programming competition in which problems are modeled after Google engineering challenges.
This year's contest is the sixth edition of Hash Code which is a competition for both students and professionals who compete in teams of two to four people work together to tackle problems using the programming language of their choice. Previously it has been for developers in the EMEA region - Europe, the Middle East, and Africa - but this year it's going global. The contest kicks off with an Online Qualification Round, in which teams can compete from wherever they want, including from one of Google's Hash Code hubs organized at offices, universities, and cities around the world so that teams can come together to compete side-by-side. For this year's contest on Thursday, February 28. there are 393 hubs across 67 countries. To compete from a hub, you must be at least 18 years of age and at least the legal age in your country of residence. Between 30 and 50 of the top teams from the qualification round will be invited to participate in Hash Code Final Round, scheduled to be held on Saturday, April 27, 2019 at the Google offices in Dublin, Ireland. If you are interested in the types of problems teams are asked to solve, the Hashcode Archive has the past problems for both the qualification rounds and finals of the past contests and the files are downloadable so you can tackle them for yourself. If you are planning to participate in Hash Code for the first time, getting familiar with past problems is the best way to prepare As Lindsay Taub, the Hash Code Program Manager, explains on the Google blog: Just like the problems that Google engineers tackle, there’s never one right answer to a Hash Code problem. Instead, each round of the competition is designed as a “battle of heuristics”—imperfect solutions. There are many ways to approach the challenge, and teams should continuously iterate on their solution throughout the round. |
| Last Updated ( Monday, 21 January 2019 ) |
