An array A consisting of N integers is given. The dominator of array A is the value that occurs in more than half of the elements of A.
For example, consider array A such that
A[0] = 3 A[1] = 4 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = -1 A[6] = 3 A[7] = 3The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7) and 5 is more than a half of 8.
Write a function
function solution(A);
that, given an array A consisting of N integers, returns index of any element of array A in which the dominator of A occurs. The function should return −1 if array A does not have a dominator.
For example, given array A such that
A[0] = 3 A[1] = 4 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = -1 A[6] = 3 A[7] = 3the function may return 0, 2, 4, 6 or 7, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- each element of array A is an integer within the range [−2,147,483,648..2,147,483,647].
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !)
}
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
}
}
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
cand
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
for ()
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
}
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
}
}
if (count > (A.length / 2.0)) {
lead
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
}
}
if (count > (A.length / 2.0)) {
leader =
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index =
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
}
}
if (count > (A.length / 2.0)) {
leader =
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
}
}
if (count > (A.length / 2.0)) {
leader =
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
leader =
}
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
i
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
[]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
[]
[1]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
[]
[1]
[1, 2, 2, 2, 3]
function result: -1
function result: 0
function result: 1
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
[]
[1]
[1, 2, 2, 2, 3]
[1, 2, 2, 2, 3, 4]
function result: -1
function result: 0
function result: 1
function result: -1
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
[]
[1]
[1, 2, 2, 2, 3]
[1, 2, 2, 2, 3, 4]
[2147483647, 2147483647, 2147483647]
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
[]
[1]
[1, 2, 2, 2, 3]
[1, 2, 2, 2, 3, 4]
[2147483647, 2147483647, 2147483647]
[1, -2147483648, 2, 1, -2147483648, -2147483648, -2147483648]
function result: -1
function result: 0
function result: 1
function result: -1
function result: 0
function result: 1
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
[]
[1]
[1, 2, 2, 2, 3]
[1, 2, 2, 2, 3, 4]
[2147483647, 2147483647, 2147483647]
[1, -2147483648, 2, 1, -2147483648, -2147483648, -2147483648]
function result: -1
function result: 0
function result: 1
function result: -1
function result: 0
function result: 1
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
// write your code in JavaScript (Node.js 8.9.4)
let size = 0;
let value = null;
for (let i = 0; i < A.length; i++) {
if (size === 0) {
size++;
value = A[i];
} else {
if (value !== A[i]) {
size--;
} else {
size++;
}
}
}
let candidate = -1;
if (size > 0) {
candidate = value;
}
let leader = -1;
let count = 0;
let index = null;
for (let i = 0; i < A.length; i++) {
if (A[i] === candidate) {
count++;
if (index === null) {
index = i;
}
}
}
if (count > (A.length / 2.0)) {
return index;
}
return -1
}
The solution obtained perfect score.