algorithms.tutorialhorizon.com
Dynamic Programming - Stairs Climbing Puzzle | Algorithms
A child is climbing up a staircase with n steps, and can hop either 1 step, 2 steps, or 3 steps at a time. Implement a method to count how many possible ways the child can jump up the stairs.