Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2838. Maximum Coins Heroes Can Collect
Given a map with coin values and multiple heroes that can move under specific step/time or path constraints, compute the maximum total coins collectible by coordinating their routes without double-counting coins or violating movement rules. This requires optimizing assignments and paths — typically solved with dynamic programming/state-compression or graph techniques like max-flow/min-cost flow depending on the exact constraints.
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.