Google Code Jam Practice

The document provides practice problems for Google Code Jam. The first problem involves calculating the maximum area rectangle that can be formed from the skyline of a city made of rectangular buildings. The input specifies the number of buildings and their widths and heights. The output is the area of the largest possible block. The second problem involves finding the shortest flight path for a galaxy crawler to visit stock exchanges on different planets while traveling through hyperspace jumpgates connecting the planets. The input specifies the planets, stock exchanges, and connections. The output lists the planets on the optimal path.