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

  • vknakul43
     + 0 comments

    Simple Solution

    Java

            int[] pairs = new int[100];
        int pairCount = 0;
        for (int i: ar)
        pairs[i - 1]++;
        
        for(int i: pairs)
        pairCount += (i / 2);
        
        return pairCount;
    }

    C++

    int sockMerchant(int n, vector<int> ar) {
    vector<int> pairs(100, 0);
    for (int i: ar)
    pairs[i - 1]++;
    int pairCount = 0;
    for (int i = 0; i < 100; i++) {
        pairCount += (pairs[i] / 2);
    }
    return pairCount;
}