Search
⌘K

Leetcode 1194. Tournament Winners

Given a set of players with some match results and remaining games, determine which players can still finish first under some assignment of outcomes; the core challenge is modeling the combinatorial allocation of future wins (often via a network flow / max-flow-min-cut construction) to test feasible non-elimination.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.