Beats 95.5% users ,begginer friendly
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def getWinner(self, arr: List[int], k: int) -> int:\n        if k==1:\n            return max(arr[0],arr[1])\n        if k >= len(arr):\n            return max(arr)\n        count=0\n        win=arr[0]\n        for i in range(1,len(arr)):\n            if win>arr[i]:\n                count=count+1\n            else:\n                win=arr[i]\n                count=1\n            if count==k:\n                return win\n        return win\n```
['Python3']