The other day, I visited Project Euler, and solved a few problems. Two of which involved a pyramids. You are asked to find the way from the top to bottom which gives the highest possible sum. In this post I explain how you can solve this super efficiently.