Untitled

class Solution {
public:
    int majorityElement(vector<int>& nums) {
        int n = nums.size();
        int count = 1;
        int elem = nums[0];
        for(int i = 1 ; i < n ; i++){
            if(nums[i] == elem){
                count++;
            }
            else{
                count = 1;
                elem = nums[i];
            }
            if(count > 1){
                return nums[i];
            }
        }
        return -1;


    }
};