Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3594. Minimum Time to Transport All Individuals
Schedule at-most-k-person crossings and single-person returns to get all n people across while minimizing total time, where each trip takes max(time of group) × mul[current_stage] and the stage advances by floor(duration) % m, producing non-linear, discrete state transitions. The core challenge is optimizing the sequence of group choices and returners under capacity and cyclic-stage effects (typically solved with DP/shortest-path over subsets and current stage).
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.