Problem · Graph
Determine Player Rankings
● Medium
GoogleFULLTIMEONSITE INTERVIEW
See Google hiring insightsGoogleFULLTIMEONSITE INTERVIEWProblem statement
The problem statement continues
ProExamples
Example 1
n = 3wins = [[0,1],[1,2]]return = [0,1,2]The chain determines every pair by transitivity.
FastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$9/month
Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week