961. N-Repeated Element in Size 2N Array

961. N-Repeated Element in Size 2N Array

class Solution {
    public int repeatedNTimes(int[] A) {
        int N = A.length/2;
        HashMap freq = new HashMap();
        for(int i = 0; i < A.length; i++){
              if(freq.get(A[i]) == null)
                freq.put(A[i],1);
            else if(freq.get(A[i]) != null){
                freq.put(A[i],freq.get(A[i]) + 1);  
                 if(freq.get(A[i]) == N) return A[i];

        }
        }
        return 0;
    }
}

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s