“Beautiful Strings” is the first and simplest of the 2013 Facebook Hacker Cup’s qualification round problems. It is valued at 20 of the 100 possible points for the round and is relatively straightforward.
Facebook’s Hacker Cup is back for its 2013 installment. The qualification round has actually already started and I will be posting solutions to those problems when the round closes (if they turn out to be correct).
Programming contests are interesting to say the least. The sheer feeling of knowing you have a limited amount of time to come up with a solution that will not only be correct but fast enough to handle large and purposefully tricky inputs is a challenge few programmers can resist.
One thing is vital in programming challenges though, figuring out what you actually need to solve and what is just noise for the particular problem at hand.
Chess 2 is the second of the three problems in the 2011 Facebook Hacker Cup elimination round 1B. I completely forgot about round 1A last Saturday and was unable to compete then. In this problem, you find yourself faced with a modified game of chess played on a 16×16 board and that contains some new […]
Double Squares is the 1st (and the easiest) of the 3 problems posted in the qualification round for the Facebook Hacker Cup. It consists of calculating how many combinations of adding two squared (integer) numbers equal a given number.
Peg Game is the 2nd (and the hardest) of the 3 problems posted in the qualification round for the Facebook Hacker Cup. It basically consists of dropping a ball through a series of pegs from the top and calculating the optimal drop position and the probability of success for making it fall on a particular slot on the bottom. Here are some thoughts on it…
I first heard about the Facebook Hacker Cup on Twitter from @lhchavez, a friend of mine, a couple of hours before it started. Being a seasoned programming contest participant (I went all the way to the 2009 ACM-ICPC World Finals), I was immediately interested and promptly signed up for it.