Here’s another problem that appeared on the 2011 Google Code Jam: You are selling beautiful geometric pictures. Each one consists of 1×1 square tiles arranged into a non-overlapping grid. For example: .##.. .#### .#### .##.. Blue tiles are represented by ‘#’ characters, and white tiles are represented by ‘.’ characters. You do not use other […]

Here’s a problem that appeared on Round 1B of Google’s Code Jam 2011 edition: Problem In the United States, 350 schools compete every year for an invitation to the NCAA College Basketball Tournament. With so many schools, how do you decide who should be invited? Most teams never play each other, and some teams have […]

In order to practice for the Round 1 of Google Code Jam 2012, which is coming in two weeks, I started solving the problems of the same round of last year’s edition. Below you’ll find the first one: The Problem I played D (D > 0) games of FreeCell today. Each game of FreeCell ends […]

This problem was worth 20 points, and you needed to think about it a bit, but finding the answer wasn’t that difficult. The Problem You’re watching a show where Googlers (employees of Google) dance, and then each dancer is given a triplet of scores by three judges. Each triplet of scores consists of three integer […]

This weekend the qualification round of Google Code Jam 2012 took place. There were 4 problems, and you need to score at least 20 points to pass to the next round. This first problem was worth 15 points, and it was pretty trivial, so pretty much 15 free points for anyone who tried. The Problem […]