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.