Available question text
Given two logs of lengths n and m and three trucks each with capacity k, minimize the total cost of cutting the logs (splitting x into len1 and len2 costs len1*len2) so that the resulting pieces (at most three) all have length ≤ k.
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 3560. Find Minimum Log Transportation Cost
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source