This page may be out of date. Save your draft before refreshing this page.Submit any pending changes before refreshing this page.

Problem statement: Dashboard - Round 3 2015 - Google Code Jam

Let's start with the small, where all the sums are non-negative. The key observation is that the lowest positive sum must be an element of S (if it were the sum of two or more positive elements of S, those individual elements would be... (more)

Let's start with the small, where all the sums are non-negative. The key observation is that the lowest positive sum must be an element of S (if it were the sum of two or more positive elements of S, those individual elements would be... (more)

Probably you have seen the famous Tower of Hanoi puzzle. But do you know how to solve it when there are 4 pegs? Or 5? The problem for today is to write a program that prints out the optimal solution for moving n (up to 64) discs on m (up to 65 pegs). The alert reader is wondering how we're going ... (more)

"Some people, when confronted with a problem, think "I know, I'll use regular expressions." Now they have two problems." - Jamie Zawinksi

Our problem: we have two regular expressions, and we want to find the shortest non-empty string (if there are several equally short strings, any will do) that... (more)

Our problem: we have two regular expressions, and we want to find the shortest non-empty string (if there are several equally short strings, any will do) that... (more)