Your browser is not supported. Please, update your browser or switch to a different one. Learn more about which browsers are supported.
Tasks Details
medium
1.
Ladder
Count the number of different ways of climbing to the top of a ladder.
Task Score
100%
Correctness
100%
Performance
100%
Task description
You have to climb up a ladder. The ladder has exactly N rungs, numbered from 1 to N. With each step, you can ascend by one or two rungs. More precisely:
- with your first step you can stand on rung 1 or 2,
- if you are on rung K, you can move to rungs K + 1 or K + 2,
- finally you have to stand on rung N.
Your task is to count the number of different ways of climbing to the top of the ladder.
For example, given N = 4, you have five different ways of climbing, ascending by:
- 1, 1, 1 and 1 rung,
- 1, 1 and 2 rungs,
- 1, 2 and 1 rung,
- 2, 1 and 1 rungs, and
- 2 and 2 rungs.
Given N = 5, you have eight different ways of climbing, ascending by:
- 1, 1, 1, 1 and 1 rung,
- 1, 1, 1 and 2 rungs,
- 1, 1, 2 and 1 rung,
- 1, 2, 1 and 1 rung,
- 1, 2 and 2 rungs,
- 2, 1, 1 and 1 rungs,
- 2, 1 and 2 rungs, and
- 2, 2 and 1 rung.
The number of different ways can be very large, so it is sufficient to return the result modulo 2P, for a given integer P.
Write a function:
function solution(A, B);
that, given two non-empty arrays A and B of L integers, returns an array consisting of L integers specifying the consecutive answers; position I should contain the number of different ways of climbing the ladder with A[I] rungs modulo 2B[I].
For example, given L = 5 and:
A[0] = 4 B[0] = 3 A[1] = 4 B[1] = 2 A[2] = 5 B[2] = 4 A[3] = 5 B[3] = 3 A[4] = 1 B[4] = 1the function should return the sequence [5, 1, 8, 0, 1], as explained above.
Write an efficient algorithm for the following assumptions:
- L is an integer within the range [1..50,000];
- each element of array A is an integer within the range [1..L];
- each element of array B is an integer within the range [1..30].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 25 minutes
Notes
not defined yet
Task timeline
Code: 10:11:16 UTC,
java,
autosave
Code: 10:12:26 UTC,
js,
autosave
Code: 10:12:49 UTC,
js,
autosave
Code: 10:12:59 UTC,
js,
verify,
result: Failed
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got [4, 0, 5, 5, 1] expected [5, 1, 8, 0, 1]
Code: 10:18:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:19:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1]
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:19:41 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max()
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:19:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:20:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:20:52 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibStep
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:21:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = fibSteps
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:21:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = fibSteps[]
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:22:02 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = fibSteps[i-1] + fibSteps[i-2])
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:22:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB)
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:22:34 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(A[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:23:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(steA[i] % Math.pow(2, B[i]))
}
return result;
}
Code: 10:23:22 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(steps(A[i]) % Math.pow(2, B[i]) - 1)
}
return result;
}
Code: 10:23:23 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(steps(A[i]) % Math.pow(2, B[i]) - 1)
}
return result;
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: steps is not defined
at solution (solution.js:15:16)
at solutionWrapper (/tmp/exec.js:419:28)
at Promise.resolve.then (/tmp/exec.js:445:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
Code: 10:23:30 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps(A[i]) % Math.pow(2, B[i]) - 1)
}
return result;
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
TypeError: fibSteps is not a function
at solution (solution.js:15:21)
at solutionWrapper (/tmp/exec.js:419:28)
at Promise.resolve.then (/tmp/exec.js:445:24)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
Code: 10:23:48 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]) - 1)
}
return result;
}
Analysis
expand all
Example tests
1.
0.068 s
WRONG ANSWER,
got [4, 0, 7, -1, 0] expected [5, 1, 8, 0, 1]
Code: 10:24:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
return result;
}
Code: 10:24:12 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
return result;
}
Analysis
Code: 10:24:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
console.log()
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
return result;
}
Code: 10:24:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fibfibSteps[A[i]])
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
return result;
}
Code: 10:25:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]])
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
return result;
}
Code: 10:25:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, )
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
return result;
}
Code: 10:25:28 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
return result;
}
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> fib, pow, & 5 7 5 -> fib, pow, & 5 3 1 -> fib, pow, & 8 15 8 -> fib, pow, & 8 7 0 -> fib, pow, & 1 1 1
Code: 10:25:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
console.log(result)
return result;
}
Code: 10:25:54 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
console.log(result)
return result;
}
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> fib, pow, & 5 7 5 -> fib, pow, & 5 3 1 -> fib, pow, & 8 15 8 -> fib, pow, & 8 7 0 -> fib, pow, & 1 1 1 [ 5, 1, 8, 0, 1 ]
Code: 10:27:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
conso
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
console.log(result)
return result;
}
Code: 10:27:33 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
console.log(fibSteps)
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
}
console.log(result)
return result;
}
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
[ 1, 1, 2, 3, 5, 8 ] -> fib, pow, & 5 7 5 -> fib, pow, & 5 3 1 -> fib, pow, & 8 15 8 -> fib, pow, & 8 7 0 -> fib, pow, & 1 1 1 [ 5, 1, 8, 0, 1 ]
Code: 10:27:41 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
console.log(fibSteps)
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] & Math.pow(2, B[i]) - 1);
}
console.log(result)
return result;
}
Code: 10:31:34 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
console.log(fibSteps)
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] Math.pow(2, B[i]) - 1);
}
console.log(result)
return result;
}
Code: 10:31:42 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
console.log(fibSteps)
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] & Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
console.log(result)
return result;
}
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
[ 1, 1, 2, 3, 5, 8 ] -> fib, pow, & 5 7 5 -> fib, pow, & 5 3 1 -> fib, pow, & 8 15 8 -> fib, pow, & 8 7 0 -> fib, pow, & 1 1 1 [ 5, 1, 8, 0, 1 ]
Code: 10:32:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
console.log(fibSteps)
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] Math.pow(2, B[i]) - 1)
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
console.log(result)
return result;
}
Code: 10:32:46 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
console.log(fibSteps)
let result = [];
for (let i = 0; i < A.length; i++) {
console.log('-> fib, pow, &', fibSteps[A[i]], Math.pow(2, B[i]) - 1, fibSteps[A[i]] % Math.pow(2, B[i]))
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
console.log(result)
return result;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
[ 1, 1, 2, 3, 5, 8 ] -> fib, pow, & 5 7 5 -> fib, pow, & 5 3 1 -> fib, pow, & 8 15 8 -> fib, pow, & 8 7 0 -> fib, pow, & 1 1 1 [ 5, 1, 8, 0, 1 ]
Code: 10:33:01 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
console.log(result)
return result;
}
Analysis
Code: 10:33:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
return result;
}
Code: 10:33:09 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
return result;
}
Analysis
Code: 10:33:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
return result;
}
Code: 10:33:52 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
return result;
}
User test case 1:
[[100], [10]]
User test case 2:
[[10, 100], [10, 1]]
Analysis
Code: 10:36:12 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
return result;
}
User test case 1:
[[100], [10]]
User test case 2:
[[10, 100], [10, 1]]
Analysis
Code: 10:36:14 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A, B) {
// write your code in JavaScript (Node.js 8.9.4)
let fibSteps = [1,1];
let max = Math.max(...A);
let maxB = Math.max(...B);
for (let i = 2; i <= max; i++) {
fibSteps[i] = (fibSteps[i-1] + fibSteps[i-2]) % Math.pow(2, maxB);
}
let result = [];
for (let i = 0; i < A.length; i++) {
result.push(fibSteps[A[i]] % Math.pow(2, B[i]));
}
return result;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(L)