def solution(num1, num2):
answer = num1 % num2
return answer
def solution(array):
array.sort()
center_idx = len(array)//2
return array[center_idx]
def solution(array):
answer = 0
idx = [0] * 1001
for i in array:
idx[i] +=1
if idx.count(max(idx)) >1:
return -1
return idx.index(max(idx))
def solution(n):
return [i for i in range(1, n+1, 2)]