Find Capable Winners

Problem Overview

• Compute the count of players who can defeat all others; each has three distinct power boosters and may reorder them per match.
• Capable: X can defeat Y if some order of X beats some order of Y in at least 2 of 3 rounds; higher booster wins a round.
• Input: arrays power_a, power_b, power_c (n); Output: integer count; Constraints: 2≤n≤1e5, values≤1e9, per-player boosters distinct.
• From Amazon interviews, set in a multiplayer tournament; a classic coding interview problem and interview question.