Sort by

recency

|

6052 Discussions

|

  • + 0 comments

    in c#

    int pairs = 0;
            var colors = ar.Distinct();
            foreach(var a in colors){
                var pair = ar.Where(x => x == a).ToList();
                if(pair.Count() % 2 != 0) pair.Remove(a);
                pairs += pair.Count()/2;
            }
            return pairs;
    
  • + 0 comments

    Python

    def sockMerchant(n, ar):
        seen = set()
        pairs = 0
        for c in ar:
            if c not in seen:
                seen.add(c)
            else:
                pairs +=1
                seen.remove(c)
        return pairs
    
  • + 0 comments

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

        foreach (var item in ar)
        {
            if (DictionaryObj.ContainsKey(item))
            {
                DictionaryObj[item]++;
            }
            else
            {
                DictionaryObj[item] = 1;
            }
        }
    
        foreach (int count in DictionaryObj.Values)
        {
            pairCount += count / 2;
        }
        return pairCount;
    }****
    
  • + 0 comments

    I want to recieve feedback about my solution in Javascript. How can I do it better?:

    function sockMerchant(n, ar) {
        ar.sort((a, b)=> a - b)
        let pairs=0;
        for(let i=0;i<ar.length;i++){
            if(ar[i]===ar[i+1]){
                pairs++;
                i++;
            }
        }
        return pairs;
    }
    
  • + 0 comments

    Java

    Map<Integer, Integer> check = new HashMap<>();
            AtomicInteger rs = new AtomicInteger(0);
            ar.forEach(it -> {
                if (check.containsKey(it)) {
                    rs.getAndIncrement();
                    check.remove(it);
                } else {
                    check.put(it, it);
                }
            });
            return rs.get();