Tasks Details
hard
Given an array, find all its elements that can become a leader, after increasing by 1 all of the numbers in some segment of a given length.
Task Score
55%
Correctness
100%
Performance
0%
Integers K, M and a non-empty array A consisting of N integers, not bigger than M, are given.
The leader of the array is a value that occurs in more than half of the elements of the array, and the segment of the array is a sequence of consecutive elements of the array.
You can modify A by choosing exactly one segment of length K and increasing by 1 every element within that segment.
The goal is to find all of the numbers that may become a leader after performing exactly one array modification as described above.
Write a function:
function solution(K, M, A);
that, given integers K and M and an array A consisting of N integers, returns an array of all numbers that can become a leader, after increasing by 1 every element of exactly one segment of A of length K. The returned array should be sorted in ascending order, and if there is no number that can become a leader, you should return an empty array. Moreover, if there are multiple ways of choosing a segment to turn some number into a leader, then this particular number should appear in an output array only once.
For example, given integers K = 3, M = 5 and the following array A:
A[0] = 2 A[1] = 1 A[2] = 3 A[3] = 1 A[4] = 2 A[5] = 2 A[6] = 3the function should return [2, 3]. If we choose segment A[1], A[2], A[3] then we get the following array A:
A[0] = 2 A[1] = 2 A[2] = 4 A[3] = 2 A[4] = 2 A[5] = 2 A[6] = 3and 2 is the leader of this array. If we choose A[3], A[4], A[5] then A will appear as follows:
A[0] = 2 A[1] = 1 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = 3 A[6] = 3and 3 will be the leader.
And, for example, given integers K = 4, M = 2 and the following array:
A[0] = 1 A[1] = 2 A[2] = 2 A[3] = 1 A[4] = 2the function should return [2, 3], because choosing a segment A[0], A[1], A[2], A[3] and A[1], A[2], A[3], A[4] turns 2 and 3 into the leaders, respectively.
Write an efficient algorithm for the following assumptions:
- N and M are integers within the range [1..100,000];
- K is an integer within the range [1..N];
- each element of array A is an integer within the range [1..M].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 37 minutes
Notes
not defined yet
Code: 03:38:44 UTC,
java,
autosave
Code: 03:45:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:45:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies =
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:46:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[])
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:46:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[el] = tallies[el])
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:46:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:48:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:48:34 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:48:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:49:01 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:49:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = [];
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:49:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:49:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies)
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:50:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:50:28 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
}
Code: 03:50:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// given a segment K long, there's a limited number of cases
}
Code: 03:51:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// given a segment K long, there's a limited number of cases
let k;
for ()
}
Code: 03:51:44 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
// make a copy
A
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// given a segment K long, there's a limited number of cases
let k;
for ()
}
Code: 03:52:00 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
// make a copy
A = [...A];
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// given a segment K long, there's a limited number of cases
let k;
for ()
}
Code: 03:52:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for ()
}
Code: 03:52:31 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < len; k++)
}
Code: 03:52:48 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
}
Code: 03:53:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
}
Code: 03:53:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try
}
Code: 03:53:29 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
}
Code: 03:53:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let answers = [];
}
Code: 03:53:51 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let answers = [];
}
Code: 03:54:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let answers = [];
for (k)
}
Code: 03:54:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let answers = [];
for (k = 1; )
}
Code: 03:54:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let answers = [];
for (k = 0; )
}
Code: 03:54:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let answers = [];
for (k = 0; ; k++)
}
Code: 03:55:09 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; ; k++)
}
Code: 03:56:18 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k; k++)
}
Code: 03:56:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
// ready for next one
}
}
Code: 03:56:47 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
// ready for next one
A[]
}
}
Code: 03:57:05 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
// ready for next one
A[k]--;
A[k + K]
}
}
Code: 03:57:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:57:27 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
if (findLeader(A))
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:57:39 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
if ()
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:57:52 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if ()
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:58:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:58:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers = [];
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers.push(leader);
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:58:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers.push(leader);
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:58:36 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[.push(]leader);
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:58:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
}
Code: 03:59:15 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return Object.keys(answers).sort();
}
Code: 03:59:35 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return Object.keys(answers).sort();
}
Code: 03:59:45 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return Object.keys(answers).sort();
}
// testing
Code: 04:00:46 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, last;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return Object.keys(answers).sort();
}
// testing
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
SyntaxError: Identifier 'last' has already been declared
at solutionWrapper (/tmp/exec.js:413:28)
at Promise.resolve.then (/tmp/exec.js:439: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:
SyntaxError: Identifier 'last' has already been declared
at solutionWrapper (/tmp/exec.js:413:28)
at Promise.resolve.then (/tmp/exec.js:439: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: 04:01:05 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k, ;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return Object.keys(answers).sort();
}
// testing
Code: 04:01:09 UTC,
js,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return Object.keys(answers).sort();
}
// testing
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'string' found
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'string' found
Code: 04:01:56 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return Object.keys(answers).sor
}
// testing
Code: 04:02:06 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
Object.keys(answers);
}
// testing
Code: 04:02:16 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers);
}
// testing
Code: 04:02:31 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers);
answers[0] =
}
// testing
Code: 04:02:58 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers).map(a => Number(a)));
answers[0] =
}
// testing
Code: 04:03:09 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers).map(a => Number(a));
answers[0] =
}
// testing
Code: 04:03:38 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 &&
answers[0] =
}
// testing
Code: 04:03:56 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
}
answers[0] =
}
// testing
Code: 04:04:26 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
{ans[0], ans[1]} = an
}
answers[0] =
}
// testing
Code: 04:04:41 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
return
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
{ans[0], ans[1]} = ans;
}
return ans
}
// testing
Code: 04:04:43 UTC,
js,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
{ans[0], ans[1]} = ans;
}
return ans
}
// testing
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:43
{ans[0], ans[1]} = ans;
^
SyntaxError: Unexpected token =
at createScript (vm.js:80:10)
at Object.runInNewContext (vm.js:135:10)
at getSolution (/tmp/exec.js:403:29)
at Promise.resolve.then (/tmp/exec.js:437:34)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
solution.js:43
{ans[0], ans[1]} = ans;
^
SyntaxError: Unexpected token =
at createScript (vm.js:80:10)
at Object.runInNewContext (vm.js:135:10)
at getSolution (/tmp/exec.js:403:29)
at Promise.resolve.then (/tmp/exec.js:437:34)
at <anonymous>
at process._tickCallback (internal/process/next_tick.js:188:7)
at Function.Module.runMain (module.js:686:11)
at startup (bootstrap_node.js:187:16)
at bootstrap_node.js:608:3
Code: 04:05:11 UTC,
js,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
let t = ans[0];
ans[0] = ans[1];
{ans[0], ans[1]} = ans;
}
return ans
}
// testing
Code: 04:05:26 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
let t = ans[0];
ans[0] = ans[1];
ans[1] = t;
}
return ans
}
// testing
Code: 04:05:31 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
let t = ans[0];
ans[0] = ans[1];
ans[1] = t;
}
return ans
}
// testing
Analysis
Code: 04:15:08 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
let t = ans[0];
ans[0] = ans[1];
ans[1] = t;
}
return ans
}
// testing
Analysis
Code: 04:15:13 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
let t = ans[0];
ans[0] = ans[1];
ans[1] = t;
}
return ans
}
// testing
Analysis
Code: 04:15:15 UTC,
js,
final,
score:
55
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
// examine the array A and return whatever value is a leader, or nUll if none
function findLeader(A) {
let tallies = {};
A.forEach(el => tallies[el] = (tallies[el] || 0) + 1);
// now search for someone with more than A.length/2
let half = A.length / 2;
for (el in tallies) {
if (tallies[el] > half)
return el;
}
return null;
}
function solution(K, M, A) {
// write your code in JavaScript (Node.js 8.9.4)
// make a copy
A = [...A];
// given a segment K long, there's a limited number of cases
let k;
for (k = 0; k < K; k++)
A[k]++;
// so we'll try all combinations
let last = A.length - K;
let answers ={};
for (k = 0; k <= last; k++) {
let leader = findLeader(A);
if (leader !== null)
answers[leader] = true;
// ready for next one
A[k]--;
A[k + K]++;
}
let ans = Object.keys(answers).map(a => Number(a));
if (ans.length >= 2 && ans[0] > ans[1]) {
let t = ans[0];
ans[0] = ans[1];
ans[1] = t;
}
return ans
}
// testing
Analysis summary
The following issues have been detected: timeout errors.
Analysis
Detected time complexity:
O(N*(N+M)) or O(N**2)
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
4.
0.072 s
OK
5.
0.072 s
OK
6.
0.076 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
4.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
expand all
Performance tests
medium_tests1
medium tests (N = 10000, M = 100)
medium tests (N = 10000, M = 100)
✘
TIMEOUT ERROR
running time: 2.892 sec., time limit: 0.352 sec.
running time: 2.892 sec., time limit: 0.352 sec.
1.
2.892 s
TIMEOUT ERROR,
running time: 2.892 sec., time limit: 0.352 sec.
2.
3.812 s
TIMEOUT ERROR,
running time: 3.812 sec., time limit: 0.336 sec.
3.
3.800 s
TIMEOUT ERROR,
running time: 3.800 sec., time limit: 0.352 sec.
medium_tests2
medium tests(N >= 20000, M=30000)
medium tests(N >= 20000, M=30000)
✘
TIMEOUT ERROR
Killed. Hard limit reached: 6.000 sec.
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
1.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
3.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.
1.
0.148 s
OK
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.