Uber·Software Engineer·Technical Phone Screen
- Given a tournament bracket where players compete in sequence, generate an input arrangement such that players with lower rank numbers are always eliminated later than players with higher rank numbers. This is a variant of the 'earliest and latest rounds' problem without the power-of-two constraint on input size.
“I asked if iterative bottom-up was fine and the interviewer said yes, but then casually mentioned recursion would be much simpler.”