We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Sales by Match
  5. Discussions

Sales by Match

  • kashishch888
     + 0 comments

    Easily Understandable Approach

    public static int sockMerchant(int n, List<Integer> ar) {
    // Write your code here
    
    Set<Integer> set = new HashSet<>();
    int c=0;

    for(Integer i:ar){
        if(set.contains(i)){
            set.remove(i);
            c++;
        }
        else{
            set.add(i);
        }
    }

    return c;
    }