Available question text
Three trucks (for M, P, G) start at house 0 and must visit houses in order to pick up one-minute-per-unit garbage with given travel times between consecutive houses, but only one truck can operate at a time. The core task is to compute the minimal total time: sum of all pickup units plus, for each garbage type that appears, the cumulative travel time needed to reach its last house (i.e., find each type's last index and add the prefix travel times).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2391. Minimum Amount of Time to Collect Garbage
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source