Algorithm: Winning Card Problem - JavaScript

winner-card.ts

// https://leetcode.com/discuss/interview-question/1768919/winning-card
function solution(cards) { 
   // write your solution here
    let winner = -1;
    let players = [];
    for (let card of cards) {
        let max = -1;
        const dict = {};
        for (let c of card) {
            dict[c] =  dict[c] ? dict[c]+1 : 1;
        }
        const max1 = Object.keys(dict).filter(k => dict[k] === 1).map(k => Number(k));
        if (max1.length > 0) {
            max = Math.max(...max1);
        }
        players.push(max);
    }
    if (players.length === 0) {
        return -1;
    }
   return Math.max(...players);
}