Google L3 loop R1
Problem statement You have 2^n players in a fixed single elimination tournament, labeled 0 to 2^n - 1. Round 1 is 0 vs 1, 2 vs 3, and so on. In later rounds, winners from neighboring bracket blocks play each other. Given p[i][j], the prob…