Problem · Array
Knockout Tournament Win Probability
● Hard
GoogleFULLTIMEPHONE SCREEN
See Google hiring insightsGoogleFULLTIMEPHONE SCREENProblem statement
There are n teams numbered from 0 to n - 1, where n is a power of two. Their positions in a fixed single-elimination bracket are their numeric order.
The matrix winProbability gives the outcome probability of every possible match: winProbability[i][j] is the probability that team i defeats team j. Match outcomes are independent.
The problem statement continues
ProExamples
Example 1
winProbability = [[0.0,0.7],[0.3,0.0]]target = 0return = 0.7The tournament has one match, which team 0 wins with probability 0.7.
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
- 2 more worked examples, 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