“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.
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.
Every programmer has heard the phrase “Premature Optimization is the Root of All Evil”; make no mistake, there is a reason this phrase is so often repeated.
Prematurely Optimizing an algorithm can lead to all sorts of trouble […]
As I’ve mentioned before, I recently got a GitHub account and I’m now posting the source to my personal projects there for anyone to see, however this presented an issue as I felt I had to select a specific Open Source License for them instead of just putting the source code out there without […]
I had recently been looking for a good version control system in which to keep track of my personal projects. I had looked for several alternatives and considered hosting a Git or SVN server myself, however I ultimately chose to go with github since it is a nice, publicly accessible solution which suits my current needs well (I don’t have a need for a private server and my projects are Open Source) and I had heard and read a lot of good things about it.
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.