A tower has n floors numbered from 0 to n - 1. Each floor has an energy cost to traverse and a reward value. You start a ball at one chosen floor and it descends through consecutive floors until energy runs out.

Given two integer arrays costs and rewards, and an integer energy: ...