Ask AI Problems Learn C++TCS Core CS HR Progress

Problems Intro Dynamic Programming

Climbing Stairs

Easy

1/3

EasyIntro Dynamic ProgrammingLeetCode #70

Climbing Stairs

Ways(n) = ways(n-1)+ways(n-2). Fibonacci in disguise.

Examples

Example 1

Input

Output

Example 2

Input

Output

Stuck? Take a nudge

C++17Autosaves