Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1601. Maximum Number of Achievable Transfer Requests
Given directed transfer requests between n buildings, find the largest subset of requests such that each building's net incoming minus outgoing transfers is zero (so no building's employee count changes). With small input sizes, this reduces to enumerating/backtracking over subsets of requests to maximize the number of edges forming a zero-net flow at every vertex.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.