Tasks Details
easy
1.
Dominator
Find an index of an array such that its value occurs at more than half of indices in the array.
Task Score
100%
Correctness
100%
Performance
100%
Task description
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
def 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].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Python
Time spent on task 5 minutes
Notes
not defined yet
Task timeline
Code: 18:08:38 UTC,
java,
autosave
Code: 18:08:48 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
def solution(A):
stack = []
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
Code: 18:09:20 UTC,
py,
verify,
result: Failed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
def solution(A):
stack = []
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
expand all
Example tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last): File "exec.py", line 129, in <module> main() File "exec.py", line 70, in main sol = __import__('solution') File "/tmp/solution.py", line 6 stack = [] ^ IndentationError: expected an indented block
expand all
User tests
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last): File "exec.py", line 129, in <module> main() File "exec.py", line 70, in main sol = __import__('solution') File "/tmp/solution.py", line 6 stack = [] ^ IndentationError: expected an indented block
1.
0.036 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Traceback (most recent call last): File "exec.py", line 129, in <module> main() File "exec.py", line 70, in main sol = __import__('solution') File "/tmp/solution.py", line 6 stack = [] ^ IndentationError: expected an indented block
Code: 18:09:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
Code: 18:09:32 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
Code: 18:10:00 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
print(idx)
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
expand all
User tests
1.
0.052 s
OK
function result: -1
function result: -1
stdout:
4
1.
0.056 s
OK
function result: 4
function result: 4
stdout:
4
Code: 18:10:30 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
print(idx)
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
Code: 18:10:43 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
print(idx,size)
print(idx)
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
0 0 1 0 2 0 3 0 4 0 5 0 6 0 7 0 7
expand all
User tests
1.
0.036 s
OK
function result: -1
function result: -1
stdout:
0 0 1 0 2 0 3 0 4 0 4
1.
0.036 s
OK
function result: 4
function result: 4
stdout:
0 0 1 0 2 0 3 0 4 0 4
Code: 18:11:07 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
print(A[idx,size)
print(idx)
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
Code: 18:11:10 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
print(A[idx],size)
print(idx)
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
3 0 4 0 3 0 2 0 3 0 -1 0 3 0 3 0 7
expand all
User tests
1.
0.036 s
OK
function result: -1
function result: -1
stdout:
2 0 1 0 1 0 1 0 3 0 4
1.
0.036 s
OK
function result: 4
function result: 4
stdout:
0 0 0 0 1 0 1 0 1 0 4
Code: 18:11:37 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
size = 1
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
print(A[idx],size)
print(idx)
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
Code: 18:11:40 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
size = 1
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
print(A[idx],size)
print(idx)
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
expand all
Example tests
1.
0.036 s
OK
stdout:
3 1 3 0 3 1 3 0 3 1 3 0 3 1 3 2 6
expand all
User tests
1.
0.036 s
OK
function result: 2
function result: 2
stdout:
2 1 2 0 1 1 1 2 1 1 2
1.
0.036 s
OK
function result: 4
function result: 4
stdout:
0 1 0 2 0 1 0 0 1 1 4
Code: 18:11:53 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
size = 1
elif A[i] != A[idx]:
size = size -1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
Code: 18:12:11 UTC,
py,
autosave
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
size = 1
elif A[i] != A[idx]:
size = size - 1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
Code: 18:12:39 UTC,
py,
verify,
result: Passed
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
size = 1
elif A[i] != A[idx]:
size = size - 1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
User test case 1:
[2, 1, 1, 1, 3]
User test case 2:
[0, 0, 1, 1, 1]
Analysis
Code: 18:12:42 UTC,
py,
final,
score:
100
# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")
def solution(A):
idx = -1
size = 0
for i in range(len(A)):
if size == 0:
idx = i
size = 1
elif A[i] != A[idx]:
size = size - 1
elif A[i] == A[idx]:
size = size +1
cnt = 0
for a in A:
if a == A[idx]: cnt = cnt +1
if cnt > len(A)/2:
return idx
else:
return -1
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N)) or O(N)
expand all
Correctness tests
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK
1.
0.036 s
OK
2.
0.036 s
OK