🟢🔴🟢 Beats 100.00%👏 Dart Solution 🟢🔴🟢
dart []\nclass Solution {\n  int winningPlayerCount(int n, List<List<int>> pick) {\n\n    int wins = 0;\n    for(int i = 0; i < n; i++){\n        List<int> pick
```dart []\nclass Solution {\n  int winningPlayerCount(int n, List<List<int>> pick) {\n\n    int wins = 0;\n    for(int i = 0; i < n; i++){\n        List<int> picks = [];\n        for(int j = 0; j < pick.length; j++){\n            if(i == pick[j].first){\n                picks.add(pick[j].last);\n            }\n        }\n        \n        if(picks.isNotEmpty && maxColor(picks) >= i+1) wins++;\n\n    }\n    return wins;\n\n  }\n\n  \n  int maxColor(List<int> picks){\n    Map<int,int> maxPick = {};\n    picks.forEach((num){\n      maxPick.update(num,(value)=> value + 1, ifAbsent: ()=> 1);\n    });\n    return maxPick.entries.reduce((a,b)=> a.value > b.value ? a : b).value;\n  }\n\n}\n```
['C', 'Python', 'C++', 'Java', 'JavaScript', 'C#', 'Dart']