Leetcode 1989. Maximum Number of People That Can Be Caught in Tag

Given rules for which people can tag which others (based on positions, times, or movement constraints), compute the largest number of people that can be caught following those rules; the core challenge is to build the directed/catchability graph and reduce the problem to a maximum matching/flow (or equivalent graph/dynamic-programming) computation.

Question Timeline

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

Company

Level

Region

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1989. Maximum Number of People That Can Be Caught in Tag

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact