Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3363. Find the Maximum Number of Fruits Collected
Three players start at three corners of an n×n grid and each make exactly n−1 constrained moves to reach (n−1,n−1), collecting fruits in visited cells but counting a cell's fruits only once if multiple players visit it. The challenge is to maximize total fruits — typically solved with dynamic programming that tracks the players' simultaneous positions (or time-step) and handles overlap to avoid double-counting.
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.