Climbing Stairs (Extra Trace) Problem

Climbing Stairs (Extra Trace) Problem — ExecCode Easy DSA Practice

Solve the Climbing Stairs (Extra Trace) problem on ExecCode. Free online easy DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Climbing Stairs (Extra Trace): dp[i]=dp[i-1]+dp[i-2] For Climbing Stairs (Extra Trace), focus on the exact input variables, return only the requested value, and preserve the required time complexity for the intended pattern.

Examples

Input n = 4; Output 5

Constraints

1 ≤ n ≤ 10^4

Practice Climbing Stairs (Extra Trace) free on ExecCode. Browse DSA problems, topic map, and placement guides.