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

Sort by

recency

|

5954 Discussions

|

  • air_mvp_jordan
     + 0 comments

    This is my solution using C#.

    public static int sockMerchant(int n, List<int> ar)
{
		Dictionary<int, int> itemCounts = new Dictionary<int, int>();
		int pairCount = 0;

		for (int i = 0; i < n; i++) {
				if (itemCounts.ContainsKey(ar[i])) {
						itemCounts[ar[i]]++;
				} else {
						itemCounts[ar[i]] = 1;
				}
		}

		foreach(var item in itemCounts) {
				pairCount += (item.Value / 2);
		}

		return pairCount;
}

    Solution for Python3

    ` def sockMerchant(n, ar): # Write your code here arCount = Counter(ar) pairCount = 0

    for item in arCount:
    pairCount += arCount[item] // 2

return pairCount

    `

  • estrada_jesus131
     + 0 comments

    In java 8:

    public static int sockMerchant(int n, List ar) { // Write your code here Integer pairs = 0; int i = 0; while(i < (ar.size() - 1)) { Integer sock = ar.get(i); for(int j = i+1; j < ar.size(); j++){ if(sock == ar.get(j)){ pairs++; ar.remove(i); ar.remove(j - 1); break; }

                if(j == (ar.size() - 1)){
                ar.remove(i);
            }
        }
    }
    return pairs;   
}

    }

  • alban_tyrex
     + 0 comments

    Here is my c++ solution , you can find the video explanation here : https://youtu.be/HPIhFXx_DVM

    int sockMerchant(int n, vector<int> ar) {
    map<int, int>mp;
    int result = 0;
    for(int i = 0; i < ar.size(); i++){
        if(mp[ar[i]]){
            result ++;
            mp.erase(ar[i]);
            continue;
        }
        mp[ar[i]]++;
    }
    return result;
}

  • senanwijeratne
     + 1 comment

    Python 3:

    def sockMerchant(n, ar):
    # Write your code here
    NewSockType = []
    Pairs = 0
    for sock in ar:
        if sock not in NewSockType:
            NewSockType.append(sock)
        else:
            Pairs += 1
            NewSockType.remove(sock)
    return Pairs

  • lalusaud
     + 0 comments

    Ruby:

    def sockMerchant(n, ar)
    ar.tally.values.inject(0) { |result, num| result + num/2 }
end