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 9 minutes
Notes
not defined yet
Code: 00:52:32 UTC,
java,
autosave
Code: 00:52:40 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:52:41 UTC,
js,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
Code: 00:53:10 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:53:29 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total <)
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:54:02 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total -)
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:54:13 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount > )
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:54:23 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < )
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:55:20 UTC,
js,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount)
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:55:31 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
isLeftDone = tru
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:55:39 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
Code: 00:55:58 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
Code: 00:56:13 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
cons
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:56:21 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('9=======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
9======= 0 1 2 9======= 0 1 9======= 0 1 2
1.
0.076 s
OK
stdout:
9======= 0 1 9======= 0 1
Code: 00:56:25 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.080 s
OK
stdout:
====== 0 1 2 ====== 0 1 ====== 0 1 2
1.
0.080 s
OK
stdout:
====== 0 1 ====== 0 1
Code: 00:57:07 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
====== 0 1 2 ====== 0 1 ====== 0 1 2
1.
0.076 s
OK
stdout:
====== 0 1 ====== 0 1
expand all
User tests
1.
0.204 s
OK
function result: []
function result: []
stdout:
====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
Code: 00:57:48 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.080 s
OK
stdout:
====== 0 1 2 ====== 0 1 ====== 0 1 2
1.
0.076 s
OK
stdout:
====== 0 1 ====== 0 1
expand all
User tests
1.
0.224 s
OK
function result: []
function result: []
stdout:
====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
1.
0.080 s
OK
function result: [1]
function result: [1]
stdout:
====== 0 1 2 3 4 5 6 7 8 9
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 00:58:01 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
====== 0 1 2 ====== 0 1 ====== 0 1 2
1.
0.076 s
OK
stdout:
====== 0 1 ====== 0 1
expand all
User tests
1.
0.200 s
OK
function result: []
function result: []
stdout:
====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 ====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
1.
0.100 s
OK
function result: [1]
function result: [1]
stdout:
====== 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 00:58:13 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
consol
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 00:58:17 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
console.log({l})
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
{ l: 7 }
======
0
1
2
======
0
1
======
0
1
2
1.
0.072 s
OK
stdout:
{ l: 5 }
======
0
1
======
0
1
expand all
User tests
1.
0.216 s
OK
function result: []
function result: []
stdout:
{ l: 117 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
1.
0.100 s
OK
function result: [1]
function result: [1]
stdout:
{ l: 351 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 00:58:42 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
console.log({l})
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
{ l: 7 }
======
0
1
2
======
0
1
======
0
1
2
1.
0.076 s
OK
stdout:
{ l: 5 }
======
0
1
======
0
1
expand all
User tests
1.
0.200 s
OK
function result: []
function result: []
stdout:
{ l: 117 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
1.
0.120 s
OK
function result: [1]
function result: [1]
stdout:
{ l: 702 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 00:58:58 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
console.log({l})
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
{ l: 7 }
======
0
1
2
======
0
1
======
0
1
2
1.
0.076 s
OK
stdout:
{ l: 5 }
======
0
1
======
0
1
expand all
User tests
1.
0.208 s
OK
function result: []
function result: []
stdout:
{ l: 117 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
1.
0.140 s
OK
function result: [1]
function result: [1]
stdout:
{ l: 1020 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 00:59:18 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
console.log({l})
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
{ l: 7 }
======
0
1
2
======
0
1
======
0
1
2
1.
0.076 s
OK
stdout:
{ l: 5 }
======
0
1
======
0
1
expand all
User tests
1.
0.204 s
OK
function result: []
function result: []
stdout:
{ l: 117 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
1.
0.140 s
OK
function result: [1]
function result: [1]
stdout:
{ l: 1020 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 00:59:34 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
console.log({l})
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
{ l: 7 }
======
0
1
2
======
0
1
======
0
1
2
1.
0.076 s
OK
stdout:
{ l: 5 }
======
0
1
======
0
1
expand all
User tests
1.
0.200 s
OK
function result: []
function result: []
stdout:
{ l: 117 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
1.
0.140 s
OK
function result: [1]
function result: [1]
stdout:
{ l: 1020 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 00:59:46 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
console.log({l})
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
{ l: 7 }
======
0
1
2
======
0
1
======
0
1
2
1.
0.076 s
OK
stdout:
{ l: 5 }
======
0
1
======
0
1
expand all
User tests
1.
0.208 s
OK
function result: []
function result: []
stdout:
{ l: 117 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
1.
0.136 s
OK
function result: [1]
function result: [1]
stdout:
{ l: 921 }
======
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 01:00:00 UTC,
js,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
console.log('======')
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Code: 01:00:09 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
let x =0;
while(true) {
console.log(x++);
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
expand all
User tests
1.
0.208 s
OK
function result: []
function result: []
stdout:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
1.
0.136 s
OK
function result: [1]
function result: [1]
stdout:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 01:00:24 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[3, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 01:00:36 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[100, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 01:00:43 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[200, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 01:00:51 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[700, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 01:01:05 UTC,
js,
verify,
result: Passed
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}
Analysis
User test case 1:
[3, 5, [2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 2, 1, 3, 1, 2, 2]]
User test case 2:
[700, 5, [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]]
Code: 01:01:07 UTC,
js,
final,
score:
55
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
function solution(K, M, A) {
let detailedArr = [];
const l = A.length;
for (let x = 0; x < A.length; x++) {
detailedArr.push({ index: x, value: A[x] })
}
let resultSet = [];
let newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let x = 0; x < A.length; x++) {
const firstIndex = x;
const lastIndex = x + K - 1;
if (lastIndex < A.length) {
newArray = detailedArr.map(item => {
return { index: item.index, value: item.value }
});
for (let y = firstIndex; y <= lastIndex; y++) {
newArray[y].value++;
}
newArray.sort((a,b) => {
return a.value - b.value;
});
const middleIndex = l % 2 === 0 ? l / 2 : (l - 1) / 2;
const candidateValue = newArray[middleIndex].value;
if (!resultSet.includes(candidateValue) && isLeader(newArray, candidateValue, middleIndex)) {
resultSet.push(candidateValue);
}
}
else {
break;
}
}
resultSet.sort((a,b) => {
return a - b;
})
return resultSet;
}
function isLeader(sortedArr, candidateValue, middleIndex) {
const leaderCountRequirement = sortedArr.length % 2 === 0 ? Math.round(sortedArr.length / 2) + 1: Math.round(sortedArr.length / 2);
let isLeftDone = false;
let isRightDone = false;
let leftIndex = middleIndex - 1;
let rightIndex = middleIndex + 1;
let totalCandidateCount = 1;
const total = sortedArr.length;
while(true) {
const lValue = sortedArr[leftIndex] ? sortedArr[leftIndex].value : '';
const rValue = sortedArr[rightIndex] ? sortedArr[rightIndex].value : '';
if (lValue === candidateValue) {
totalCandidateCount++;
}
else {
isLeftDone = true;
}
if (rValue === candidateValue){
totalCandidateCount++;
}
else {
isRightDone = true;
}
leftIndex--;
rightIndex++;
if (total - totalCandidateCount < totalCandidateCount) {
return true;
}
if (isLeftDone && isRightDone) {
break;
}
if (leftIndex <= 0) {
isLeftDone = true;
}
if (rightIndex >= sortedArr.length - 1) {
isRightDone = true;
}
}
return totalCandidateCount >= leaderCountRequirement;
}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.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.104 s
OK
6.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 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: 4.164 sec., time limit: 0.336 sec.
running time: 4.164 sec., time limit: 0.336 sec.
1.
4.164 s
TIMEOUT ERROR,
running time: 4.164 sec., time limit: 0.336 sec.
2.
4.084 s
TIMEOUT ERROR,
running time: 4.084 sec., time limit: 0.336 sec.
3.
4.376 s
TIMEOUT ERROR,
running time: 4.376 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.432 s
OK
2.
6.000 s
TIMEOUT ERROR,
Killed. Hard limit reached: 6.000 sec.