Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3466. Maximum Coin Collection
Given a grid or graph of coin values and movement constraints (e.g., move from a start to an end cell, possibly with a return trip or multiple walkers) compute the maximum total coins you can collect without counting any coin twice and avoiding blocked cells. This typically reduces to dynamic programming over positions (or pairs of positions) or bitmask states to track collected coins and maximize the sum.
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.