[Java] Straightforward one pass O(N)
\n    public int getWinner(int[] arr, int k) {\n        int n = arr.length;\n        int max = arr[0];\n        int cons = 0;\n        int win = arr[0];\n      
```\n    public int getWinner(int[] arr, int k) {\n        int n = arr.length;\n        int max = arr[0];\n        int cons = 0;\n        int win = arr[0];\n        for(int i=1; i<n; i++){\n            if(win==Math.max(win, arr[i])){\n                cons++;\n            }\n            else{\n                cons = 1;\n            }\n            \n            win = Math.max(win, arr[i]);\n            max = Math.max(max, arr[i]);\n            if(cons==k){\n                return win;\n            }\n        }\n        return max;\n    }\n```
[]