Tasks Details
medium
1.
Flags
Find the maximum number of flags that can be set on mountain peaks.
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given.
A peak is an array element which is larger than its neighbours. More precisely, it is an index P such that 0 < P < N − 1 and A[P − 1] < A[P] > A[P + 1].
For example, the following array A:
A[0] = 1 A[1] = 5 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2has exactly four peaks: elements 1, 3, 5 and 10.
You are going on a trip to a range of mountains whose relative heights are represented by array A, as shown in a figure below. You have to choose how many flags you should take with you. The goal is to set the maximum number of flags on the peaks, according to certain rules.
Flags can only be set on peaks. What's more, if you take K flags, then the distance between any two flags should be greater than or equal to K. The distance between indices P and Q is the absolute value |P − Q|.
For example, given the mountain range represented by array A, above, with N = 12, if you take:
- two flags, you can set them on peaks 1 and 5;
- three flags, you can set them on peaks 1, 5 and 10;
- four flags, you can set only three flags, on peaks 1, 5 and 10.
You can therefore set a maximum of three flags in this case.
Write a function:
function solution(A);
that, given a non-empty array A of N integers, returns the maximum number of flags that can be set on the peaks of the array.
For example, the following array A:
A[0] = 1 A[1] = 5 A[2] = 3 A[3] = 4 A[4] = 3 A[5] = 4 A[6] = 1 A[7] = 2 A[8] = 3 A[9] = 4 A[10] = 6 A[11] = 2the function should return 3, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..400,000];
- each element of array A is an integer within the range [0..1,000,000,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 61 minutes
Notes
not defined yet
Code: 11:57:28 UTC,
java,
autosave
Code: 11:58:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakCount = 0;
let lastPeakIndex = Number.MIN_SAFE_INTEGER;
let minPeakDistance = Number.MAX_SAFE_INTEGER;
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakCount++;
minPeakDistance = Math.min(minPeakDistance, i - lastPeakIndex + 1);
lastPeakIndex = i;
}
}
return Math.min(peakCount, minPeakDistance);
}
Code: 11:59:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPo = 0;
let lastPeakIndex = Number.MIN_SAFE_INTEGER;
let minPeakDistance = Number.MAX_SAFE_INTEGER;
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakCount++;
minPeakDistance = Math.min(minPeakDistance, i - lastPeakIndex + 1);
lastPeakIndex = i;
}
}
return Math.min(peakCount, minPeakDistance);
}
Code: 11:59:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
let lastPeakIndex = Number.MIN_SAFE_INTEGER;
let minPeakDistance = Number.MAX_SAFE_INTEGER;
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakCount++;
minPeakDistance = Math.min(minPeakDistance, i - lastPeakIndex + 1);
lastPeakIndex = i;
}
}
return Math.min(peakCount, minPeakDistance);
}
Code: 11:59:35 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
}
Analysis
expand all
Example tests
1.
0.112 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 1, 3, 5, 10 ]
Code: 11:59:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
}
Code: 12:01:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (l)
console.log(peakPositions);
}
Code: 12:01:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (let i = 0; i < peakPositions.length; i++) {
}
console.log(peakPositions);
}
Code: 12:01:45 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (let i = peakPositions.length; i > 0; i++) {
}
console.log(peakPositions);
}
Code: 12:02:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (let i = peakPositions.length; i > 1; i++) {
}
return 0;
}
Code: 12:02:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (let i = peakPositions.length; i > 1; i++) {
while
}
return 0;
}
Code: 12:03:07 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (let i = peakPositions.length; i > 1; i++) {
let j = 0;
while (j) { j++; }
}
return 0;
}
Code: 12:03:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (let i = peakPositions.length; i > 1; i++) {
let j = 0;
while (j < peakPositions.length && j) { j++; }
}
return 0;
}
Code: 12:03:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
for (let i = peakPositions.length; i > 1; i++) {
let j = 0;
while (true) {
if (j > peakPositions.)
j++;
}
}
return 0;
}
Code: 12:04:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i++) {
let j = 0;
while (true) {
if (j > M) break;
if (peakPositions[j] )
j++;
}
}
return 0;
}
Code: 12:04:49 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i++) {
let j = 0;
while (true) {
if (j > M) break;
if (peakPositions[j] + i > peakPositions[j + 1] )
j++;
}
}
return 0;
}
Code: 12:05:06 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i++) {
let j = 0;
while (true) {
if (j > M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Analysis
expand all
Example tests
1.
5.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 5.000 sec.
Code: 12:05:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i--) {
let j = 0;
while (true) {
if (j > M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:05:56 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i--) {
let j = 0;
while (true) {
if (j > M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 0 expected 3
Code: 12:06:17 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i--) {
let j = 0;
while (true) {
if (j >= M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 2 expected 3
Code: 12:06:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i--) {
let j = 0;
while (true) {
if (j = M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:06:35 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 1; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 2 expected 3
Code: 12:45:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > ,; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:45:25 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let i = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 2 expected 3
Code: 12:45:58 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let imin = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:46:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let minDistance = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + i > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:46:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let minDistance = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:46:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = peakPositions.length;
for (let max = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:47:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = const maxFlagCount = Math.floor(Math.sqrt(A.length)) + 1;
for (let max = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:47:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(A.length)) + 1;
for (let max = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:48:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
for (let max = M; i > 0; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:48:17 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
for (let i = 0; i < M; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:48:31 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
for (let i = 1; i < M; i--) {
let j = 0;
while (true) {
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:49:02 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
for (let i = 1; i <= M; i++) {
const
for (let j = 0; j < peakPositions.length; j++) {
}
if (j === M) break;
if (peakPositions[j] + minDistance > peakPositions[j + 1]) {
break;
}
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:49:23 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
for (let i = 1; i <= M; i++) {
const count = 0;
for (let j = 0; j < peakPositions.length; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
}
if (j === M) break;
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:49:54 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
for (let i = 1; i <= M; i++) {
const count = 0;
for (let j = 0; j < peakPositions.length; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
if (j === M) break;
j++;
}
if (j === M) {
return i;
}
}
return 0;
}
Code: 12:50:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
for (let i = 1; i <= M; i++) {
const count = 0;
for (let j = 0; j < peakPositions.length; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
}
return 0;
}
Code: 12:50:33 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
const count = 0;
for (let j = 0; j < peakPositions.length; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
TypeError: Assignment to constant variable.
at solution (solution.js:21:22)
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: 12:50:42 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:50:43 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got 2 expected 3
Code: 12:51:09 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(peakPositions.length)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 2 expected 3
Code: 12:51:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(length)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:51:36 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(N)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.068 s
WRONG ANSWER,
got 2 expected 3
Code: 12:52:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.l
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:52:11 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i > peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 2 expected 3
stdout:
[ 1, 3, 5, 10 ] 4 0 0 2 2
Code: 12:53:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i < peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:53:14 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i < peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 1 expected 3
stdout:
[ 1, 3, 5, 10 ] 4 1 1 1 1
Code: 12:53: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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i <= peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got 2 expected 3
stdout:
[ 1, 3, 5, 10 ] 4 1 2 1 1
Code: 12:54:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let l
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i <= peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:54:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = 0;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i <= peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:54:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = Number.MIN_VALUE;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i <= peakPositions[j + 1]) {
count++;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:54:55 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = Number.MIN_VALUE;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] + i <= peakPositions[j + 1]) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:55:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = Number.MIN_VALUE;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[lastIndex] + i <= peakPositions[j + 1]) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:55:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = -;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[lastIndex] + i <= peakPositions[j + 1]) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:55:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = -i;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[lastIndex] + i <= peakPositions[j + 1]) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:55:59 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = -i;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[lastIndex] >= peakPositions[j + 1]) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:56:16 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = -i;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] >= peakPositions[j + 1]) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:56:46 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = -i;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] >= peakPositions[lastIndex] ) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:56:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = -i;
for (let j = 0; j < peakPositions.length - 1; j++) {
if (peakPositions[j] >= peakPositions[lastIndex] + i) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:57:24 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastIndex = -i;
for (let peakPosition of peakPositions) {
if (peakPositions[j] >= peakPositions[lastIndex] + i) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:57:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastPosition = -i;
for (const peakPosition of peakPositions) {
if (peakPosition >= lastPosition + i) {
count++;
lastIndex = j;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:57:51 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastPosition = -i;
for (const peakPosition of peakPositions) {
if (peakPosition >= lastPosition + i) {
count++;
lastPosition = peakPosition;
}
if (count === i) {
break;
}
}
console.log(count);
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
[ 1, 3, 5, 10 ] 4 1 2 3 3
Code: 12:58:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastPosition = -i;
for (const peakPosition of peakPositions) {
if (peakPosition >= lastPosition + i) {
count++;
lastPosition = peakPosition;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Code: 12:58: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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
console.log(peakPositions);
const M = Math.floor(Math.sqrt(N)) + 1;
console.log(M);
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastPosition = -i;
for (const peakPosition of peakPositions) {
if (peakPosition >= lastPosition + i) {
count++;
lastPosition = peakPosition;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
Code: 12:58: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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(N)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastPosition = -i;
for (const peakPosition of peakPositions) {
if (peakPosition >= lastPosition + i) {
count++;
lastPosition = peakPosition;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
Code: 12:58:18 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(N)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastPosition = -i;
for (const peakPosition of peakPositions) {
if (peakPosition >= lastPosition + i) {
count++;
lastPosition = peakPosition;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}
Analysis
Code: 12:58:21 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) {
const N = A.length;
let peakPositions = [];
for (let i = 1; i < N - 1; i++) {
if (A[i] > A[i - 1] && A[i] > A[i + 1]) {
peakPositions.push(i);
}
}
const M = Math.floor(Math.sqrt(N)) + 1;
let maxFlagCount = 0;
for (let i = 1; i <= M; i++) {
let count = 0;
let lastPosition = -i;
for (const peakPosition of peakPositions) {
if (peakPosition >= lastPosition + i) {
count++;
lastPosition = peakPosition;
}
if (count === i) {
break;
}
}
maxFlagCount = Math.max(maxFlagCount, count);
}
return maxFlagCount;
}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.072 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
1.
0.068 s
OK
1.
0.072 s
OK
1.
0.088 s
OK
2.
0.088 s
OK
1.
0.068 s
OK
2.
0.080 s
OK
expand all
Performance tests
1.
0.168 s
OK
2.
0.116 s
OK
1.
0.112 s
OK
2.
0.200 s
OK
1.
0.128 s
OK
2.
0.140 s
OK
1.
0.356 s
OK
2.
0.144 s
OK
1.
0.140 s
OK
2.
0.140 s
OK
1.
0.204 s
OK
2.
0.156 s
OK
1.
0.196 s
OK
2.
0.196 s
OK