mobile typing isn't scored — practice only
int climbStairs(int n) {
C++ · leetcode · type the snippet below to practice
def fib(n):
a, b = 0, 1
for _ in range(n):
a, b = b, a + b
return a
about this snippet
This is the climbstairs snippet in C++ — a classic LeetCode interview problem. Type it through to build the muscle memory you need to write it under interview pressure. DeveloperType scores you on net WPM and accuracy and only counts runs above 95% accuracy on the leaderboard, so practice rewards precision, not speed alone.
view source (11 lines)
int climbStairs(int n) {
if (n <= 2) return n;
int a = 1, b = 2;
for (int i = 3; i <= n; ++i) {
int c = a + b;
a = b;
b = c;
}
return b;
}
more C++ snippets:
browse all C++ snippets →