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

|

6046 Discussions

|

  • asimparui2003
     + 0 comments

    def sockMerchant(n, ar): # Write your code here count=0 y= Counter(ar) for i in y.values(): t=int(i/2) count+=t * return count

  • asimparui2003
     + 0 comments

    def sockMerchant(n, ar): # Write your code here count=0 y= Counter(ar) for i in y.values(): t=int(i/2) count+=t * return count

  • asimparui2003
     + 0 comments

    def sockMerchant(n, ar): # Write your code here count=0 y= Counter(ar) for i in y.values(): t=int(i/2) count+=t return count

  • afzal_saiyed931
     + 0 comments
    def sockMerchant(n, ar):
    # Write your code here
    
    temp = {}
    pairs = 0
    for i in ar:
        if not temp.get(i):
            temp[i] = 1
        else:
            temp[i] = 0
            pairs += 1
    return pairs

  • mrz_strazzullo
     + 0 comments

    My solution with Python

    def sockMerchant(n, ar): # Write your code here ar.sort() count = 0 dict = {} for number in ar: if number not in dict: dict[number] = 1 else: value = dict.get(number) dict[number] = value + 1

    for key, value in dict.items():
    count += (value // 2)

return count