# Introduction In this challenge, we will be solving a problem where Little Rabbit wants to travel to the moon using a ladder with n steps. Little Rabbit can jump 1 or 2 steps at a time, and we need to find how many ways there are for Little Rabbit to reach the moon. We will explore two approaches to solve this problem: recursion and dynamic programming.
Click the virtual machine below to start practicing