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 32 minutes
Notes
not defined yet
Code: 16:05:29 UTC,
java,
autosave
Code: 16:07:46 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
}
Code: 16:08:07 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i)
}
Code: 16:08: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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 3; i <= A.length; i++) {
}
}
Code: 16:08:48 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 3; i <= A.length; i++) {
if (A.length % i === 0) {
const
}
}
}
Code: 16:09:18 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 3; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount
}
}
}
Code: 16:09:35 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 3; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
}
}
}
Code: 16:11: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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 3; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let
}
}
}
Code: 16:11:49 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 3; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let
}
}
}
Code: 16:13:13 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 2; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let
}
}
}
Code: 16:13:43 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 2; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let gro
}
}
}
Code: 16:13:53 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 2; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let flags = 0
}
}
}
Code: 16:14:03 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let flags = 0
}
}
}
Code: 16:14:19 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / i;
let flags = 0
}
}
}
Code: 16:14:29 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % === 0) {
const blockCount = A.length / i;
let flags = 0
}
}
}
Code: 16:14: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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let i = 2; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let flags = 0
}
}
}
Code: 16:14:55 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; i <= A.length; i++) {
if (A.length % i === 0) {
const blockCount = A.length / i;
let flags = 0
}
}
}
Code: 16:15: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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
let flags = 0
}
}
}
Code: 16:15: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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
}
}
}
Code: 16:16:10 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
let flagPlanted = 0;
for (let)
}
}
}
Code: 16:16:22 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
let flagPlanted = 0;
for (let peak)
}
}
}
Code: 16:16:38 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
let flagPlanted = 0;
for (let peak of peaks) {
if ()
}
}
}
}
Code: 16:17: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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
let flagPlanted = 0;
for (let jpeak of peaks) {
if ()
}
}
}
}
Code: 16:17: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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
let flagPlanted = 0;
for (let j = 1; j) {
if ()
}
}
}
}
Code: 16:18:03 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)
if (A.length < 3) {
return 0;
}
let peaks = []
for(let i = 1; i < A.length - 1; i++) {
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks.push(i);
}
}
if (peaks.length < 2) {
return peaks.length;
}
let maxSize = 0;
for (let flags = 2; flags <= A.length; flags++) {
if (A.length % flags === 0) {
const blockCount = A.length / flags;
let flagPlanted = 0;
for (let j = 1; j < peaks.length; j++) {
if ()
}
}
}
}
Code: 16:21:12 UTC,
js,
autosave
Code: 16:21:32 UTC,
js,
autosave
Code: 16:21:42 UTC,
js,
autosave
Code: 16: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length-1; i > 1)
}
Code: 16:22:22 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length-1; i > 1; i--) {
peaks[]
}
}
Code: 16:23:32 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.lengt1; i > 1; i--) {
peaks[]
}
}
Code: 16:23: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = 1; i < A.length - 1; i++) {
peaks[]
}
}
Code: 16:24: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = 1; i < A.length - 1; i++) {
peaks[i] = 0;
if (A[i] > )
}
}
Code: 16: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = 1; i < A.length - 1; i++) {
peaks[i] = 0;
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks[i] = 1;
count
}
}
}
Code: 16:25: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = 1; i < A.length - 1; i++) {
peaks[i] = 0;
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks[i] = 1;
count++;
}
}
}
Code: 16:25: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i < A.length - 1; i++) {
peaks[i] = 0;
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks[i] = 1;
count++;
}
}
}
Code: 16:26:05 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i] > A[i-1] && A[i] > A[i+1]) {
peaks[i] = 1;
count++;
}
}
}
Code: 16:26:26 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
}
}
Code: 16:26:56 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
}
}
}
Code: 16:27:18 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
}
Code: 16:27:48 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
}
}
Code: 16:28:03 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else
}
}
Code: 16:28:22 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
}
Code: 16:28:52 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 peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
}
Code: 16:29:22 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if ()
}
Code: 16:29: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
}
Code: 16:30:10 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, P)
}
Code: 16:30: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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length)))
}
Code: 16:30:42 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
}
Code: 16:30:57 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max)
}
Code: 16:31:10 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--)
}
Code: 16:31:21 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
}
}
Code: 16:32:16 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let
}
}
Code: 16:32:46 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let
}
}
Code: 16:32:56 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j =
}
}
Code: 16: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) {
// write your code in JavaScript (Node.js 8.9.4)
let count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base]
}
}
Code: 16:33:35 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if ()
}
}
}
Code: 16:33:49 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i)
}
}
}
Code: 16:34:19 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
}
}
}
}
Code: 16:34:34 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
}
}
Code: 16:34:47 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
}
}
Code: 16:35:04 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (count >= i)
}
}
Code: 16:35:18 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (count >= i) {
}
}
}
Code: 16:35:31 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (tally >= i) {
return i;
}
}
}
Code: 16:35:45 UTC,
js,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < arr.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (tally >= i) {
return i;
}
}
return 0;
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: arr is not defined
at solution (solution.js:47:20)
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: 16:36:01 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < peaks.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (tally >= i) {
return i;
}
}
return 0;
}
Code: 16:36:03 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < peaks.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (tally >= i) {
return i;
}
}
return 0;
}
Analysis
Code: 16:36:39 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < peaks.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (tally >= i) {
return i;
}
}
return 0;
}
Analysis
Code: 16:36:50 UTC,
js,
verify,
result: Passed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < peaks.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (tally >= i) {
return i;
}
}
return 0;
}
Analysis
Code: 16:36:52 UTC,
js,
final,
score:
100
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// 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 count = 0;
let peaks = [0];
let next = [0];
peaks[A.length-1] = 0;
next[A.length-1] = -1;
for (let i = A.length - 1; i > 1; i--) {
peaks[i-1] = 0;
if (A[i-1] > A[i-2] && A[i-1] > A[i]) {
peaks[i-1] = 1;
count++;
}
if (peaks[i] === 1) {
next[i-1] = i;
} else {
next[i-1] = next[i];
}
}
if (next.length > 1) {
if (peaks[1] === 1) {
next[0] = 1;
} else {
next[0] = next[1];
}
}
if (count < 2) {
return count;
}
const max = Math.min(count, parseInt(Math.sqrt(A.length))) + 1;
for (let i = max; i > 0; i--) {
let tally = 1;
let base = next[0];
let j = next[base];
while (j < peaks.length && j > 0) {
if (j - base >= i) {
tally++;
base = j;
j = next[base];
} else {
j = next[j];
}
}
if (tally >= i) {
return i;
}
}
return 0;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 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.068 s
OK
1.
0.084 s
OK
2.
0.084 s
OK
1.
0.068 s
OK
2.
0.084 s
OK
expand all
Performance tests
1.
0.132 s
OK
2.
0.120 s
OK
1.
0.124 s
OK
2.
0.268 s
OK
1.
0.128 s
OK
2.
0.128 s
OK
1.
0.212 s
OK
2.
0.120 s
OK
1.
0.128 s
OK
2.
0.128 s
OK
1.
0.196 s
OK
2.
0.216 s
OK
1.
0.312 s
OK
2.
0.264 s
OK