Tasks Details
medium
1.
Peaks
Divide an array into the maximum number of same-sized blocks, each of which should contain an index P such that A[P - 1] < A[P] > A[P + 1].
Task Score
90%
Correctness
100%
Performance
80%
A non-empty array A consisting of N integers is given.
A peak is an array element which is larger than its neighbors. More precisely, it is an index P such that 0 < P < N − 1, A[P − 1] < A[P] and A[P] > A[P + 1].
For example, the following array A:
A[0] = 1 A[1] = 2 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 three peaks: 3, 5, 10.
We want to divide this array into blocks containing the same number of elements. More precisely, we want to choose a number K that will yield the following blocks:
- A[0], A[1], ..., A[K − 1],
- A[K], A[K + 1], ..., A[2K − 1],
...- A[N − K], A[N − K + 1], ..., A[N − 1].
What's more, every block should contain at least one peak. Notice that extreme elements of the blocks (for example A[K − 1] or A[K]) can also be peaks, but only if they have both neighbors (including one in an adjacent blocks).
The goal is to find the maximum number of blocks into which the array A can be divided.
Array A can be divided into blocks as follows:
- one block (1, 2, 3, 4, 3, 4, 1, 2, 3, 4, 6, 2). This block contains three peaks.
- two blocks (1, 2, 3, 4, 3, 4) and (1, 2, 3, 4, 6, 2). Every block has a peak.
- three blocks (1, 2, 3, 4), (3, 4, 1, 2), (3, 4, 6, 2). Every block has a peak. Notice in particular that the first block (1, 2, 3, 4) has a peak at A[3], because A[2] < A[3] > A[4], even though A[4] is in the adjacent block.
However, array A cannot be divided into four blocks, (1, 2, 3), (4, 3, 4), (1, 2, 3) and (4, 6, 2), because the (1, 2, 3) blocks do not contain a peak. Notice in particular that the (4, 3, 4) block contains two peaks: A[3] and A[5].
The maximum number of blocks that array A can be divided into is three.
Write a function:
function solution(A);
that, given a non-empty array A consisting of N integers, returns the maximum number of blocks into which A can be divided.
If A cannot be divided into some number of blocks, the function should return 0.
For example, given:
A[0] = 1 A[1] = 2 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..100,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 45 minutes
Notes
not defined yet
Code: 14:48:56 UTC,
java,
autosave
Code: 14:50:34 UTC,
js,
autosave
Code: 14:50: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 peakIdx = [];
let factors = [];
let i;
for (i = 1; i * i < A.length; i++) {
if (A.length % i === 0) {
}
}
}
Code: 14:51: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 peakIdx = [];
let factors = [];
let i;
for (i = 1; i * i < A.length; i++) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
}
if ()
}
Code: 14:51: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 peakIdx = [];
let factors = [];
let i;
for (i = 1; i * i < A.length; i++) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
}
if (i * i === A.length) {
factors.push(i);
}
}
Code: 14:52: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)
let peakIdx = [];
let factors = [];
let i;
for (i = 1; i * i < A.length; i++) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:52: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)
let peakIdx = [];
let factors = [];
let i;
for (i = 1; i * < A.length; i++) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:53: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 peakIdx = [];
let factors = [];
let i;
for (i = 1; i < A.length; i++) {
if (i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:53:33 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 peakIdx = [];
let factors = [];
let i;
for (i = 1; i < A.length; i++) {
if (i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:53: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 peakIdx = [];
let factors = [];
let i;
for (i = 1; i < A.length; i++) {
if (i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:53: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 peakIdx = [];
let factors = [];
let i;
for (i = 1; i < A.length; i++) {
if (i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:54: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)
let peakIdx = [];
let factors = [];
let i;
for (let i = 1; i < A.length; i++) {
if (i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:54: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 peakIdx = [];
let factors = [];
for (let i = 1; i < A.length; i++) {
if (i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:55: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 peakIdx = [];
let factors = [];
for (let i = 0; i < A.length; i++) {
if (i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:55: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)
let peakIdx = [];
let factors = [];
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:55: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 peakIdx = [];
let factors = [];
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0 || A)
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:56: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)
let peakIdx = [];
let factors = [];
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0 || i === A.length-1) {
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:56: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 peakIdx = [];
let factors = [];
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0) {
} else if|| i === A.length-1) {
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:56: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 peakIdx = [];
let factors = [];
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0) {
} else if (i === A.length-1) {
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:57:33 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 peakIdx = [];
let factors = [];
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0) {
} else if (i === A.length-1) {
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:57:58 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0) {
} else if (i === A.length-1) {
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:58: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0) {
} else if (i === A.length-1) {
peak = true;
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:58:59 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
if (i === 0 && A[i] > A[i+]) {
peak
} else if (i === A.length-1) {
peak = true;
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:59: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+]) {
peak = true
} else if (i === A.length-1) {
peak = true;
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:59: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+]) {
peak = true
} else if (i === A.length-1 && A[i] > ) {
peak = true;
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:59: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 14:59: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if ()
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:00: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if ()
if (peak) {
peakIdx.push()
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:00:36 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1])
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:01: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[])
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:01:17 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:01: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = fa
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:02: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 0 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:02: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:03: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
ad
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length) {
factors.push(i);
}
peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:04: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrt) {
factors.push(i);
}
peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:04:34 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:04: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
}
Code: 15:12:31 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factor.sort((a,b) => a-b);
for
}
Code: 15:12: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (factor of factors)
}
Code: 15:13: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (factor of factors) {
}
}
Code: 15:13:59 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
fo
}
Code: 15:14: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
}
}
Code: 15:15: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)
let peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for
}
}
Code: 15:15:33 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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peaks.length)
}
}
Code: 15:15: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (i > 1 && i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:17: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 peakIdx = [];
let factors = [];
if (A.length === 1) {
return 1;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:18:09 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} else if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:18: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
let peak = false;
if (i === 0 && A[i] > A[i+1]) {
peak = true
} else if (i === A.length-1 && A[i] > A[i-1]) {
peak = true;
} if (A[i-1] < A[i] && A[i+1] < A[i]) {
peak = true
}
if (peak) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:19:04 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:20: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:20:58 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 0; i < A.length-1; i++) {
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:21: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length - 1; i++) {
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:21: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length - 1; i++) {
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:22: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length - 1; i++) {
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
for (let i = 0; i < A.length; i++) {
if (A.length % i === 0)
}
}
Code: 15:22:20 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length - 1; i++) {
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
for (let i = 0; i < A.length; i++) {
if (A.length % i === 0) {
}
}
}
Code: 15:22: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 0; i < A.length; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:23:17 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = ; i < A.length; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
}
Code: 15:23:41 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++)
}
return 1;
}
Code: 15:24: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
for (let j = 0; j < peakIdx.length; j++) {
if
}
}
return 1;
}
Code: 15:24:36 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup
for (let j = 0; j < peakIdx.length; j++) {
if
}
}
return 1;
}
Code: 15:24: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if
}
}
return 1;
}
Code: 15:24:59 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parse)
}
}
return 1;
}
Code: 15:25:17 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/))
}
}
return 1;
}
Code: 15:25: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)
let peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]))
}
}
return 1;
}
Code: 15:25:53 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
}
}
}
return 1;
}
Code: 15:26:04 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
lastGroup++;
}
}
}
return 1;
}
Code: 15:26: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
lastGroup++;
}
}
if
}
return 1;
}
Code: 15:26:31 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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let lastGroup = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
if
}
return 1;
}
Code: 15:26: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
if (groupHasPeak + 1 === )
}
return 1;
}
Code: 15:27: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 peakIdx = [];
let factors = [];
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
if (groupHasPeak + 1 === factors[factors.length-1-i]) {
}
}
return 1;
}
Code: 15:27: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 peakIdx = [];
let factors = [];
let maxLimit =
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
if (groupHasPeak + 1 === factors[factors.length-1-i]) {
}
}
return 1;
}
Code: 15:28:41 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 peakIdx = [];
let factors = [];
let maxLim
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
if (groupHasPeak + 1 === factors[factors.length-1-i]) {
}
}
return 1;
}
Code: 15:28: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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
if (groupHasPeak + 1 === factors[factors.length-1-i]) {
}
}
return 1;
}
Code: 15: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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
if (groupHasPeak + 1 === factors[factors.length-1-i]) {
if (factors[factors.length-1-i] > max)
}
}
return 1;
}
Code: 15:29: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)
let peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
const blockCount =
if (groupHasPeak + 1 === factors[factors.length-1-i]) {
if (factors[factors.length-1-i] > maxSize) {
}
}
}
return 1;
}
Code: 15:30: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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return 1;
}
Code: 15:30: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)
let peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:30:21 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
for (let i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: i is not defined
at solution (solution.js:28:5)
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:30:44 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:30:45 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === lastGroup + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: lastGroup is not defined
at solution (solution.js:36:53)
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:30: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)
let peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:30:57 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Analysis
Code: 15: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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:31:33 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:31:33 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
User test case 1:
[1, 2, 3, 2, 1, 3, 1, 3, 2]
Analysis
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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
User test case 1:
[1, 2, 3, 2, 1, 3, 1, 3, 2]
User test case 2:
[1]
Analysis
Code: 15:32:02 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
User test case 1:
[1, 2, 3, 2, 1, 3, 1, 3, 2]
User test case 2:
[1]
User test case 3:
[10, 1, 1, 10]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.072 s
OK
function result: 0
function result: 0
1.
0.072 s
OK
function result: 0
function result: 0
Code: 15:32: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)
let peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:32:14 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
User test case 1:
[1, 2, 3, 2, 1, 3, 1, 3, 2]
User test case 2:
[1]
User test case 3:
[10, 1, 1, 10]
User test case 4:
[1, 10, 10, 1]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 0
function result: 0
1.
0.068 s
OK
function result: 0
function result: 0
1.
0.072 s
OK
function result: 0
function result: 0
Code: 15:32: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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:33: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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (peakIdx < 2) {
return pealIdx.length
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Code: 15:33:30 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (peakIdx < 2) {
return pealIdx.length;
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
User test case 1:
[1, 2, 3, 2, 1, 3, 1, 3, 2]
User test case 2:
[1]
User test case 3:
[10, 1, 1, 10]
User test case 4:
[1, 10, 10, 1]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.068 s
OK
function result: 0
function result: 0
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: pealIdx is not defined
at solution (solution.js:30:9)
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
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: pealIdx is not defined
at solution (solution.js:30:9)
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:33:37 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (peakIdx < 2) {
return peakIdx.length;
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
User test case 1:
[1, 2, 3, 2, 1, 3, 1, 3, 2]
User test case 2:
[1]
User test case 3:
[10, 1, 1, 10]
User test case 4:
[1, 10, 10, 1]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.072 s
OK
function result: 0
function result: 0
1.
0.068 s
OK
function result: 0
function result: 0
1.
0.068 s
OK
function result: 0
function result: 0
Code: 15:33:47 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (peakIdx < 2) {
return peakIdx.length;
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
User test case 1:
[1, 2, 3, 2, 1, 3, 1, 3, 2]
User test case 2:
[1]
User test case 3:
[10, 1, 1, 10]
User test case 4:
[1, 10, 10, 1]
Analysis
expand all
User tests
1.
0.072 s
OK
function result: 3
function result: 3
1.
0.072 s
OK
function result: 0
function result: 0
1.
0.072 s
OK
function result: 0
function result: 0
1.
0.072 s
OK
function result: 0
function result: 0
Code: 15:33:49 UTC,
js,
final,
score:
90
// 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 peakIdx = [];
let factors = [];
let maxSize = 0;
if (A.length < 3) {
return 0;
}
let overSqrtN = false
let i;
for (i = 1; i < A.length-1; i++) {
if ( i * i < A.length) {
if (A.length % i === 0) {
factors.push(i);
factors.push(A.length / i);
}
} else if (i * i === A.length && !overSqrtN) {
factors.push(i);
overSqrtN = true;
}
if (A[i-1] < A[i] && A[i+1] < A[i]) {
peakIdx.push(i);
}
}
if (peakIdx < 2) {
return peakIdx.length;
}
if (i * i === A.length) {
factors.push(i);
}
factors.sort((a,b) => a-b);
for (let i = 0; i < factors.length; i++) {
let groupHasPeak = -1;
for (let j = 0; j < peakIdx.length; j++) {
if (parseInt(peakIdx[j]/factors[i]) === groupHasPeak + 1) {
groupHasPeak++;
}
}
const blockCount = factors[factors.length-1-i]
if (groupHasPeak + 1 === blockCount) {
if (blockCount > maxSize) {
maxSize = blockCount;
}
}
}
return maxSize;
}
Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N * log(log(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
5.
0.068 s
OK
1.
0.072 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
expand all
Performance tests
1.
0.080 s
OK
2.
0.076 s
OK
1.
0.096 s
OK
1.
0.152 s
OK
2.
0.124 s
OK
large_anti_slow
large test anti slow solutions
large test anti slow solutions
✘
TIMEOUT ERROR
running time: 0.460 sec., time limit: 0.448 sec.
running time: 0.460 sec., time limit: 0.448 sec.
1.
0.100 s
OK
2.
0.460 s
TIMEOUT ERROR,
running time: 0.460 sec., time limit: 0.448 sec.
1.
0.264 s
OK
2.
0.124 s
OK