aboutsummaryrefslogtreecommitdiff
path: root/challenge-195/sgreen/python/ch-2.py
blob: 0ba621b63fe616747ef5302b519327b7ee3622f1 (plain)
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
#!/usr/bin/env python3

import sys


def main(array):
    # Count the frequency of even numbers
    evens = {}
    for i in array:
        if i % 2 == 0:
            evens[i] = evens.get(i, 0) + 1

    if not evens:
        # If no evens, return -1
        print(-1)
    else:
        # Find the evens that occur most often
        m = max(evens.values())
        max_evens = [i for i, v in evens.items() if v == m]

        # The the minimum even that occurs most often
        min_max_evens = min(max_evens)
        print(min_max_evens)


if __name__ == '__main__':
    # Turn the strings into integers
    n = [int(i) for i in sys.argv[1:]]
    main(n)