https://github.com/vilarj/nth_step_problem
Find the number of different ways to climb an n-stage ladder when each step is either one or two stages. (For example, a 3-stage ladder can be three ways: 1-1-1, 1-2, and 2-1)
https://github.com/vilarj/nth_step_problem
Last synced: 6 months ago
JSON representation
Find the number of different ways to climb an n-stage ladder when each step is either one or two stages. (For example, a 3-stage ladder can be three ways: 1-1-1, 1-2, and 2-1)
- Host: GitHub
- URL: https://github.com/vilarj/nth_step_problem
- Owner: vilarj
- Created: 2020-02-04T15:47:59.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2020-02-04T16:05:17.000Z (over 5 years ago)
- Last Synced: 2023-03-06T05:40:17.506Z (over 2 years ago)
- Language: Java
- Size: 1.95 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0