[Python3] 6-line O(N)
Algo \nHere, the key point is that one doesn\'t need to really append the value to the array as when one pass is done the largest value will be obtained (which 
Algo \nHere, the key point is that one doesn\'t need to really append the value to the array as when one pass is done the largest value will be obtained (which will be the answer). `k` here only serves the purpose of "early break". \n\n```\nclass Solution:\n    def getWinner(self, arr: List[int], k: int) -> int:\n        win = cnt = 0 #winner & count \n        for i, x in enumerate(arr): \n            if win < x: win, cnt = x, 0 #new winner in town \n            if i: cnt += 1 #when initializing (i.e. i == 0) count is 0\n            if cnt == k: break #early break \n        return win \n```
['Python3']