Tasks Details
medium
In a given array, find the subset of maximal sum in which the distance between consecutive elements is at most 6.
Task Score
100%
Correctness
100%
Performance
100%
A game for one player is played on a board consisting of N consecutive squares, numbered from 0 to N − 1. There is a number written on each square. A non-empty array A of N integers contains the numbers written on the squares. Moreover, some squares can be marked during the game.
At the beginning of the game, there is a pebble on square number 0 and this is the only square on the board which is marked. The goal of the game is to move the pebble to square number N − 1.
During each turn we throw a six-sided die, with numbers from 1 to 6 on its faces, and consider the number K, which shows on the upper face after the die comes to rest. Then we move the pebble standing on square number I to square number I + K, providing that square number I + K exists. If square number I + K does not exist, we throw the die again until we obtain a valid move. Finally, we mark square number I + K.
After the game finishes (when the pebble is standing on square number N − 1), we calculate the result. The result of the game is the sum of the numbers written on all marked squares.
For example, given the following array:
A[0] = 1 A[1] = -2 A[2] = 0 A[3] = 9 A[4] = -1 A[5] = -2one possible game could be as follows:
- the pebble is on square number 0, which is marked;
- we throw 3; the pebble moves from square number 0 to square number 3; we mark square number 3;
- we throw 5; the pebble does not move, since there is no square number 8 on the board;
- we throw 2; the pebble moves to square number 5; we mark this square and the game ends.
The marked squares are 0, 3 and 5, so the result of the game is 1 + 9 + (−2) = 8. This is the maximal possible result that can be achieved on this board.
Write a function:
function solution(A);
that, given a non-empty array A of N integers, returns the maximal result that can be achieved on the board represented by array A.
For example, given the array
A[0] = 1 A[1] = -2 A[2] = 0 A[3] = 9 A[4] = -1 A[5] = -2the function should return 8, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [2..100,000];
- each element of array A is an integer within the range [−10,000..10,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 29 minutes
Notes
not defined yet
Code: 15:03:33 UTC,
java,
autosave
Code: 15:14:27 UTC,
js,
autosave
Code: 15:14:46 UTC,
js,
autosave
Code: 15:15:15 UTC,
js,
autosave
Code: 15:15:32 UTC,
js,
autosave
Code: 15:15:57 UTC,
js,
autosave
Code: 15:16:07 UTC,
js,
autosave
Code: 15:19:00 UTC,
js,
autosave
Code: 15:19:25 UTC,
js,
autosave
Code: 15:19:40 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => );
for (let i = 0; i < A.length; i++) {
for (let j = 1, j < 6; j++) {
}
}
}
Code: 15:20:02 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = 1, j < 6; j++) {
}
}
}
Code: 15:20:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = Math.max(0, i - 6), j < 6; j++) {
}
}
}
Code: 15:21:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = Math.max(0, i - 6), j < ; j++) {
}
}
}
Code: 15:21:30 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = Math.max(0, i - 6), j < i; j++) {
result[i] = Math.max(result[i], result[j] + A[i]);
}
}
}
Code: 15:21:49 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = Math.max(0, i - 6), j < i; j++) {
result[i] = Math.max(result[i], result[j] + A[i]);
}
}
return result[result.length - 1]
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:10
for (let j = Math.max(0, i - 6), j < i; j++) {
^
SyntaxError: Unexpected token <
at createScript (vm.js:80:10)
at Object.runInNewContext (vm.js:135:10)
at getSolution (/tmp/exec.js:392:29)
at Promise.resolve.then (/tmp/exec.js:426:34)
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: 15:21:58 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = Math.max(0, i - 6); j < i; j++) {
result[i] = Math.max(result[i], result[j] + A[i]);
}
}
return result[result.length - 1]
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: result is not defined
at solution (solution.js:11:13)
at solutionWrapper (/tmp/exec.js:402:28)
at Promise.resolve.then (/tmp/exec.js:428: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: 15:22:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = Math.max(0, i - 6); j < i; j++) {
dp[i] = Math.max(result[i], result[j] + A[i]);
}
}
return result[result.length - 1]
}
Code: 15:22:15 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = Math.max(0, i - 6); j < i; j++) {
dp[i] = Math.max(dp[i], dp[j] + A[i]);
}
}
return dp[dp.length - 1]
}
Analysis
Code: 15:22:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i; j < i; j++) {
dp[i] = Math.max(dp[i], dp[j] + A[i]);
}
}
return dp[dp.length - 1]
}
Code: 15:23:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i; j < i +; j++) {
dp[i] = Math.max(dp[i], dp[j] + A[i]);
}
}
return dp[dp.length - 1]
}
Code: 15:23:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i; j < i + 6; j++) {
dp[i] = Math.max(dp[i], dp[j] + A[i]);
}
}
return dp[dp.length - 1]
}
Code: 15:23:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i; j < i + 6; j++) {
dp[j] = Math.max(dp[i], dp[j] + A[i]);
}
}
return dp[dp.length - 1]
}
Code: 15:24:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6; j++) {
dp[j] = Math.max(dp[j], dp[j] + A[i]);
}
}
return dp[dp.length - 1]
}
Code: 15:24:24 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number found
Code: 15:24:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 ; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:25:03 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Analysis
Code: 15:25:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:25:38 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, -1, 1]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 15
function result: 15
1.
0.072 s
OK
function result: 1
function result: 1
Code: 15:25:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:25:53 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 15
function result: 15
1.
0.072 s
OK
function result: 1
function result: 1
Code: 15:26:20 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
User tests
1.
0.076 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 15
function result: 15
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: -3
function result: -3
Code: 15:28:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
co
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:28:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
console.log('-> i, j, ')
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:28:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
console.log('-> i, j, dpi, aj, dpj:')
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:29:00 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 -2 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 0 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 9 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 1 -2 -Infinity -> i, j, dpi, aj, dpj: 1 2 -1 0 1 -> i, j, dpi, aj, dpj: 1 3 -1 9 10 -> i, j, dpi, aj, dpj: 1 4 -1 -1 0 -> i, j, dpi, aj, dpj: 1 5 -1 -2 -1 -> i, j, dpi, aj, dpj: 2 3 1 9 10 -> i, j, dpi, aj, dpj: 2 4 1 -1 0 -> i, j, dpi, aj, dpj: 2 5 1 -2 -1 -> i, j, dpi, aj, dpj: 3 4 10 -1 0 -> i, j, dpi, aj, dpj: 3 5 10 -2 -1 -> i, j, dpi, aj, dpj: 4 5 9 -2 8
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 15
function result: 15
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 2 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 3 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 4 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 5 -Infinity -> i, j, dpi, aj, dpj: 1 2 3 3 4 -> i, j, dpi, aj, dpj: 1 3 3 4 5 -> i, j, dpi, aj, dpj: 1 4 3 5 6 -> i, j, dpi, aj, dpj: 2 3 6 4 7 -> i, j, dpi, aj, dpj: 2 4 6 5 8 -> i, j, dpi, aj, dpj: 3 4 10 5 11
1.
0.076 s
OK
function result: 1
function result: 1
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 -10 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 1 -1 -Infinity -> i, j, dpi, aj, dpj: 1 2 -9 -1 0 -> i, j, dpi, aj, dpj: 1 3 -9 -1 0 -> i, j, dpi, aj, dpj: 1 4 -9 -1 0 -> i, j, dpi, aj, dpj: 1 5 -9 -1 0 -> i, j, dpi, aj, dpj: 1 6 -9 1 -Infinity -> i, j, dpi, aj, dpj: 2 3 0 -1 0 -> i, j, dpi, aj, dpj: 2 4 0 -1 0 -> i, j, dpi, aj, dpj: 2 5 0 -1 0 -> i, j, dpi, aj, dpj: 2 6 0 1 -8 -> i, j, dpi, aj, dpj: 3 4 0 -1 0 -> i, j, dpi, aj, dpj: 3 5 0 -1 0 -> i, j, dpi, aj, dpj: 3 6 0 1 1 -> i, j, dpi, aj, dpj: 4 5 0 -1 0 -> i, j, dpi, aj, dpj: 4 6 0 1 1 -> i, j, dpi, aj, dpj: 5 6 0 1 1
1.
0.072 s
OK
function result: -3
function result: -3
stdout:
-> i, j, dpi, aj, dpj: 0 1 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 2 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 3 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 4 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 1 2 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 3 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 6 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 2 3 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 2 7 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 3 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 3 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 3 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 3 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 3 8 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 4 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 4 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 9 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 5 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 9 -2 -1 -3 -> i, j, dpi, aj, dpj: 6 7 -3 -1 -3 -> i, j, dpi, aj, dpj: 6 8 -3 -1 -3 -> i, j, dpi, aj, dpj: 6 9 -3 -1 -3 -> i, j, dpi, aj, dpj: 7 8 -3 -1 -3 -> i, j, dpi, aj, dpj: 7 9 -3 -1 -3 -> i, j, dpi, aj, dpj: 8 9 -3 -1 -3
Code: 15:29:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 1; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:29:52 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 1; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number foundstdout:
-> i, j, dpi, aj, dpj: 1 2 -Infinity 0 -Infinity -> i, j, dpi, aj, dpj: 1 3 -Infinity 9 -Infinity -> i, j, dpi, aj, dpj: 1 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 5 -Infinity -2 -Infinity -> i, j, dpi, aj, dpj: 2 3 -Infinity 9 -Infinity -> i, j, dpi, aj, dpj: 2 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 5 -Infinity -2 -Infinity -> i, j, dpi, aj, dpj: 3 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 5 -Infinity -2 -Infinity -> i, j, dpi, aj, dpj: 4 5 -Infinity -2 -Infinity
expand all
User tests
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number foundstdout:
-> i, j, dpi, aj, dpj: 1 2 -Infinity 3 -Infinity -> i, j, dpi, aj, dpj: 1 3 -Infinity 4 -Infinity -> i, j, dpi, aj, dpj: 1 4 -Infinity 5 -Infinity -> i, j, dpi, aj, dpj: 2 3 -Infinity 4 -Infinity -> i, j, dpi, aj, dpj: 2 4 -Infinity 5 -Infinity -> i, j, dpi, aj, dpj: 3 4 -Infinity 5 -Infinity
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number foundstdout:
-> i, j, dpi, aj, dpj: 1 2 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 3 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 6 -Infinity 1 -Infinity -> i, j, dpi, aj, dpj: 2 3 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 6 -Infinity 1 -Infinity -> i, j, dpi, aj, dpj: 3 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 6 -Infinity 1 -Infinity -> i, j, dpi, aj, dpj: 4 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 4 6 -Infinity 1 -Infinity -> i, j, dpi, aj, dpj: 5 6 -Infinity 1 -Infinity
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, non-integer number foundstdout:
-> i, j, dpi, aj, dpj: 1 2 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 3 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 1 6 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 3 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 6 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 2 7 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 4 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 6 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 7 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 3 8 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 4 5 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 4 6 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 4 7 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 4 8 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 4 9 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 5 6 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 5 7 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 5 8 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 5 9 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 6 7 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 6 8 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 6 9 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 7 8 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 7 9 -Infinity -1 -Infinity -> i, j, dpi, aj, dpj: 8 9 -Infinity -1 -Infinity
Code: 15:30:05 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j < i + 6 && j < A.length; j++) {
console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 -2 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 0 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 9 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 1 -2 -Infinity -> i, j, dpi, aj, dpj: 1 2 -1 0 1 -> i, j, dpi, aj, dpj: 1 3 -1 9 10 -> i, j, dpi, aj, dpj: 1 4 -1 -1 0 -> i, j, dpi, aj, dpj: 1 5 -1 -2 -1 -> i, j, dpi, aj, dpj: 2 3 1 9 10 -> i, j, dpi, aj, dpj: 2 4 1 -1 0 -> i, j, dpi, aj, dpj: 2 5 1 -2 -1 -> i, j, dpi, aj, dpj: 3 4 10 -1 0 -> i, j, dpi, aj, dpj: 3 5 10 -2 -1 -> i, j, dpi, aj, dpj: 4 5 9 -2 8
expand all
User tests
1.
0.072 s
OK
function result: 1
function result: 1
1.
0.076 s
OK
function result: 15
function result: 15
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 2 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 3 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 4 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 5 -Infinity -> i, j, dpi, aj, dpj: 1 2 3 3 4 -> i, j, dpi, aj, dpj: 1 3 3 4 5 -> i, j, dpi, aj, dpj: 1 4 3 5 6 -> i, j, dpi, aj, dpj: 2 3 6 4 7 -> i, j, dpi, aj, dpj: 2 4 6 5 8 -> i, j, dpi, aj, dpj: 3 4 10 5 11
1.
0.084 s
OK
function result: 1
function result: 1
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 -10 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 1 -1 -Infinity -> i, j, dpi, aj, dpj: 1 2 -9 -1 0 -> i, j, dpi, aj, dpj: 1 3 -9 -1 0 -> i, j, dpi, aj, dpj: 1 4 -9 -1 0 -> i, j, dpi, aj, dpj: 1 5 -9 -1 0 -> i, j, dpi, aj, dpj: 1 6 -9 1 -Infinity -> i, j, dpi, aj, dpj: 2 3 0 -1 0 -> i, j, dpi, aj, dpj: 2 4 0 -1 0 -> i, j, dpi, aj, dpj: 2 5 0 -1 0 -> i, j, dpi, aj, dpj: 2 6 0 1 -8 -> i, j, dpi, aj, dpj: 3 4 0 -1 0 -> i, j, dpi, aj, dpj: 3 5 0 -1 0 -> i, j, dpi, aj, dpj: 3 6 0 1 1 -> i, j, dpi, aj, dpj: 4 5 0 -1 0 -> i, j, dpi, aj, dpj: 4 6 0 1 1 -> i, j, dpi, aj, dpj: 5 6 0 1 1
1.
0.076 s
OK
function result: -3
function result: -3
stdout:
-> i, j, dpi, aj, dpj: 0 1 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 2 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 3 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 4 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 1 2 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 3 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 6 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 2 3 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 2 7 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 3 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 3 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 3 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 3 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 3 8 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 4 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 4 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 9 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 5 6 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 9 -2 -1 -3 -> i, j, dpi, aj, dpj: 6 7 -3 -1 -3 -> i, j, dpi, aj, dpj: 6 8 -3 -1 -3 -> i, j, dpi, aj, dpj: 6 9 -3 -1 -3 -> i, j, dpi, aj, dpj: 7 8 -3 -1 -3 -> i, j, dpi, aj, dpj: 7 9 -3 -1 -3 -> i, j, dpi, aj, dpj: 8 9 -3 -1 -3
Code: 15:30:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:30:48 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
Example tests
1.
0.072 s
OK
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 -2 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 0 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 9 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 1 -2 -Infinity -> i, j, dpi, aj, dpj: 1 2 -1 0 1 -> i, j, dpi, aj, dpj: 1 3 -1 9 10 -> i, j, dpi, aj, dpj: 1 4 -1 -1 0 -> i, j, dpi, aj, dpj: 1 5 -1 -2 -1 -> i, j, dpi, aj, dpj: 2 3 1 9 10 -> i, j, dpi, aj, dpj: 2 4 1 -1 0 -> i, j, dpi, aj, dpj: 2 5 1 -2 -1 -> i, j, dpi, aj, dpj: 3 4 10 -1 0 -> i, j, dpi, aj, dpj: 3 5 10 -2 -1 -> i, j, dpi, aj, dpj: 4 5 9 -2 8
expand all
User tests
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 15
function result: 15
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 2 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 3 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 4 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 5 -Infinity -> i, j, dpi, aj, dpj: 1 2 3 3 4 -> i, j, dpi, aj, dpj: 1 3 3 4 5 -> i, j, dpi, aj, dpj: 1 4 3 5 6 -> i, j, dpi, aj, dpj: 2 3 6 4 7 -> i, j, dpi, aj, dpj: 2 4 6 5 8 -> i, j, dpi, aj, dpj: 3 4 10 5 11
1.
0.072 s
OK
function result: 2
function result: 2
stdout:
-> i, j, dpi, aj, dpj: 0 1 1 -10 -Infinity -> i, j, dpi, aj, dpj: 0 2 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 3 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 4 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 6 1 1 -Infinity -> i, j, dpi, aj, dpj: 1 2 -9 -1 0 -> i, j, dpi, aj, dpj: 1 3 -9 -1 0 -> i, j, dpi, aj, dpj: 1 4 -9 -1 0 -> i, j, dpi, aj, dpj: 1 5 -9 -1 0 -> i, j, dpi, aj, dpj: 1 6 -9 1 2 -> i, j, dpi, aj, dpj: 2 3 0 -1 0 -> i, j, dpi, aj, dpj: 2 4 0 -1 0 -> i, j, dpi, aj, dpj: 2 5 0 -1 0 -> i, j, dpi, aj, dpj: 2 6 0 1 2 -> i, j, dpi, aj, dpj: 3 4 0 -1 0 -> i, j, dpi, aj, dpj: 3 5 0 -1 0 -> i, j, dpi, aj, dpj: 3 6 0 1 2 -> i, j, dpi, aj, dpj: 4 5 0 -1 0 -> i, j, dpi, aj, dpj: 4 6 0 1 2 -> i, j, dpi, aj, dpj: 5 6 0 1 2
1.
0.072 s
OK
function result: -3
function result: -3
stdout:
-> i, j, dpi, aj, dpj: 0 1 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 2 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 3 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 4 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 5 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 0 6 -1 -1 -Infinity -> i, j, dpi, aj, dpj: 1 2 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 3 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 6 -2 -1 -2 -> i, j, dpi, aj, dpj: 1 7 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 2 3 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 6 -2 -1 -2 -> i, j, dpi, aj, dpj: 2 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 2 8 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 3 4 -2 -1 -2 -> i, j, dpi, aj, dpj: 3 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 3 6 -2 -1 -2 -> i, j, dpi, aj, dpj: 3 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 3 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 3 9 -2 -1 -Infinity -> i, j, dpi, aj, dpj: 4 5 -2 -1 -2 -> i, j, dpi, aj, dpj: 4 6 -2 -1 -2 -> i, j, dpi, aj, dpj: 4 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 4 9 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 6 -2 -1 -2 -> i, j, dpi, aj, dpj: 5 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 5 9 -2 -1 -3 -> i, j, dpi, aj, dpj: 6 7 -2 -1 -3 -> i, j, dpi, aj, dpj: 6 8 -2 -1 -3 -> i, j, dpi, aj, dpj: 6 9 -2 -1 -3 -> i, j, dpi, aj, dpj: 7 8 -3 -1 -3 -> i, j, dpi, aj, dpj: 7 9 -3 -1 -3 -> i, j, dpi, aj, dpj: 8 9 -3 -1 -3
Code: 15:31:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
// console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Code: 15:31:24 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
// console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 1
function result: 1
1.
0.072 s
OK
function result: 15
function result: 15
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -3
function result: -3
Code: 15:31:41 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
// console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1, 2]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 15
function result: 15
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -3
function result: -3
Code: 15:31:48 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
// console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1, -100]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
User tests
1.
0.068 s
OK
function result: -99
function result: -99
1.
0.068 s
OK
function result: 15
function result: 15
1.
0.068 s
OK
function result: 2
function result: 2
1.
0.068 s
OK
function result: -3
function result: -3
Code: 15:32: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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
// console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
User test case 1:
[1, -100]
User test case 2:
[1, 2, 3, 4, 5]
User test case 3:
[1, -10, -1, -1, -1, -1, 1]
User test case 4:
[-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
Analysis
expand all
User tests
1.
0.116 s
OK
function result: -99
function result: -99
1.
0.116 s
OK
function result: 15
function result: 15
1.
0.116 s
OK
function result: 2
function result: 2
1.
0.104 s
OK
function result: -3
function result: -3
Code: 15:32:04 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) {
// write your code in JavaScript (Node.js 8.9.4)
let dp = Array.from({ length: A.length }, () => -Infinity);
dp[0] = A[0];
for (let i = 0; i < A.length; i++) {
for (let j = i + 1; j <= i + 6 && j < A.length; j++) {
// console.log('-> i, j, dpi, aj, dpj:', i, j, dp[i], A[j], dp[j])
dp[j] = Math.max(dp[j], dp[i] + A[j]);
}
}
return dp[dp.length - 1]
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.072 s
OK
1.
0.072 s
OK
1.
0.072 s
OK