Online Election Python Solution with Tests

lcpy gen -n 911   # by problem number
lcpy gen -s online_election   # by problem name

Input
["TopVotedCandidate", "q", "q", "q", "q", "q", "q"]
[[[0, 1, 1, 0, 0, 1, 0], [0, 5, 10, 15, 20, 25, 30]], [3], [12], [25], [15], [24], [8]]
Output
[null, 0, 1, 1, 0, 0, 1]

Explanation
TopVotedCandidate topVotedCandidate = new TopVotedCandidate([0, 1, 1, 0, 0, 1, 0], [0, 5, 10, 15, 20, 25, 30]);
topVotedCandidate.q(3); // return 0, At time 3, the votes are [0], and 0 is leading.
topVotedCandidate.q(12); // return 1, At time 12, the votes are [0,1,1], and 1 is leading.
topVotedCandidate.q(25); // return 1, At time 25, the votes are [0,1,1,0,0,1], and 1 is leading (as ties go to the most recent vote.)
topVotedCandidate.q(15); // return 0
topVotedCandidate.q(24); // return 0
topVotedCandidate.q(8); // return 1

from bisect import bisect_right


class TopVotedCandidate:
    # Time: O(n) to build the leader timeline
    # Space: O(n) for the leader timeline
    def __init__(self, persons: list[int], times: list[int]) -> None:
        self.times = times
        self.leaders: list[int] = []
        counts: dict[int, int] = {}
        leader = -1
        for person in persons:
            counts[person] = counts.get(person, 0) + 1
            if counts[person] >= counts.get(leader, 0):
                leader = person
            self.leaders.append(leader)

    # Time: O(log n)
    # Space: O(1)
    def q(self, t: int) -> int:
        return self.leaders[bisect_right(self.times, t) - 1]