Search
⌘K
Get Premium
Leetcode 3560. Find Minimum Log Transportation Cost
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.
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.