100% time complexity
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:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int getWinner(int[] arr, int k) {\n        int currentMax = arr[0];\n        int count = 0;\n\n        for (int i = 1; i < arr.length; i++) {\n            if (arr[i] > currentMax) {\n                currentMax = arr[i];\n                count = 1;\n            } else {\n                count++;\n            }\n\n            if (count == k) {\n                return currentMax;\n            }\n        }\n\n        return currentMax;\n    }\n}\n\n```
['Java']