dde272c4b8
i18n - Build Validation / Validate i18n Builds (24) (push) Has been cancelled
CI - Node.js / Lint (24) (push) Has been cancelled
CI - Node.js / Build (24) (push) Has been cancelled
CI - Node.js / Test (24) (push) Has been cancelled
CI - Node.js / Test - Upcoming Changes (24) (push) Has been cancelled
CI - Node.js / Test - i18n (italian, 24) (push) Has been cancelled
CI - Node.js / Test - i18n (portuguese, 24) (push) Has been cancelled
CD - Docker - GHCR Images / Build and Push Images (push) Has been cancelled
1.2 KiB
1.2 KiB
id, title, challengeType, dashedName
| id | title | challengeType | dashedName |
|---|---|---|---|
| 69bc6cb30c1d112a2e110a09 | Challenge 252: Unique Stair Climber | 28 | challenge-252 |
--description--
Given a number of stairs, return how many distinct ways someone can climb them taking either 1 or 2 steps at a time.
--hints--
getUniqueClimbs(4) should return 5.
assert.equal(getUniqueClimbs(4), 5);
getUniqueClimbs(5) should return 8.
assert.equal(getUniqueClimbs(5), 8);
getUniqueClimbs(10) should return 89.
assert.equal(getUniqueClimbs(10), 89);
getUniqueClimbs(18) should return 4181.
assert.equal(getUniqueClimbs(18), 4181);
getUniqueClimbs(29) should return 832040.
assert.equal(getUniqueClimbs(29), 832040);
getUniqueClimbs(50) should return 20365011074.
assert.equal(getUniqueClimbs(50), 20365011074);
--seed--
--seed-contents--
function getUniqueClimbs(steps) {
return steps;
}
--solutions--
function getUniqueClimbs(steps) {
if (steps <= 0) return 0;
if (steps === 1) return 1;
if (steps === 2) return 2;
let prev2 = 1, prev1 = 2;
for (let i = 3; i <= steps; i++) {
[prev2, prev1] = [prev1, prev2 + prev1];
}
return prev1;
}