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

  • ivnagst
     + 0 comments

    Typescript solution. Time O(n), Space O(k). k is the number of colors.

    function sockMerchant(n: number, ar: number[]): number { if (n < 2) return 0;

    const unpairedSocks = new Set<number>();
let pairs = 0;

for (const color of ar) {
    if (unpairedSocks.has(color)) {
        pairs++;
        unpairedSocks.delete(color);
    } else {
        unpairedSocks.add(color);
    }
}

return pairs;

    }