Search
⌘K

Leetcode 3238. Find the Number of Winning Players

Given n players and a list of (player, color) picks, count how many players i have picked the same color at least i+1 times (player 0 needs ≥1, player 1 needs ≥2, etc.). This reduces to computing per-player color frequencies and checking whether any color meets the i+1 threshold.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.