One Pass O ( 1) space Video explanation
https://youtu.be/KWo_5Oqi5h4\n\n\n\n   int getWinner(vector<int> &arr, int k)\n    {\n       int n = arr.size() , win = 0  , ele = arr[0];\n        for(int i = 
https://youtu.be/KWo_5Oqi5h4\n\n\n```\n   int getWinner(vector<int> &arr, int k)\n    {\n       int n = arr.size() , win = 0  , ele = arr[0];\n        for(int i = 1 ; i < n ; i++){\n            if(arr[i] > ele){\n                ele = arr[i]; // peresent ele can be the possible winner\n                win =  0;\n            }\n            \n            //pre increment\n            if(++win == k) break;\n        }\n        return ele;\n    }\n```\n\nsubscribe u if want to learn more \nhttps://www.youtube.com/user/meetchhavibansal
['C', 'C++']