Give massive files with a list of N integers; how would you find an element that is seen N/2 + 1 times given that it always exists?
Implement the solution for a sequence of integers and return the integer occurring more than half the time. The sequence may be processed incrementally, so avoid storing frequency counts or requiring the entire input in memory.
Input: A non-empty iterable of integers. Output: The integer occurring at least N/2 + 1 times. The majority element is guaranteed to exist.
def find_majority_element(nums):