The Python question was interesting and complex. It involved writing functions that resolved the following scenario - two angry frogs. Given a list of “platforms” represented by random integers, calculate the furthest these two frogs may path away from one another. They must start side by side, and can only move from a platform with a lower number to a platform with a higher number.