🔥🔥🔥C++ | super easy | clean code | simulation | beats 100% runtime🔥🔥🔥
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 {\npublic:\n    int getWinner(vector<int>& arr, int k) {\n        \n        int maxi = max(arr[0],arr[1]);\n\n        int n = arr.size(); \n        int cnt = 0;\n\n        for(int i=1; i<n; i++){\n            int curr_maxi = max(maxi,arr[i]);\n            if(curr_maxi == maxi){\n                cnt++;\n                if(cnt == k) return curr_maxi;\n                continue;\n            }\n            cnt = 1;\n            maxi = curr_maxi;\n        }\n\n        return maxi;\n    }\n};\n```
['Array', 'Simulation', 'C++']