Python; O(1) space; O(n) time - Single Pass
We need to find the element that is greater than k-1 consecutive elements (assuming it\'s not the first element and is greater than the previous element, so k-1
We need to find the element that is greater than k-1 consecutive elements (assuming it\'s not the first element and is greater than the previous element, so k-1 + 1 = k). Traverse till the end and if we haven\'t found such an element yet, then the max(arr[:]) will be the answer (stored as current_num in the below solution).\n```\ndef getWinner(self, arr: List[int], k: int) -> int:\n        \n        current_num = arr[0]\n        count = 0\n        for i in range(1, len(arr)):\n            if current_num > arr[i]:\n                count += 1\n            else:\n                current_num = arr[i]\n                count = 1\n            if count == k:\n                    break\n\n        return current_num\n```
['Python']