# Introduction In this challenge, we will work with Wayne, who is stuck in space without gravity. Wayne sees a sky bridge consisting of stepping stones, with each stone having three options to step on (J, Q, or K). However, if Wayne steps on three consecutive stones that are not the same, he will fall. The goal is to find the number of ways Wayne can safely reach the end of the sky bridge. To complete this challenge, we need to understand Java arrays, recursive calculations, and building tables.
Click the virtual machine below to start practicing