Directi Interview Question for Software Engineers
- 0of 0 votes
Given n boxes of different weights and m machines of different weight carrying capacity. Find the minimum time required to move all boxes.- vivekagal1998 October 28, 2018 in India
Machines Capacities : C , C , C,........C[m-1].
Box Weights : W , W , W .... W[n].
Each machine takes 1 minute to carry one time. What can be the optimal approach recursive approach will be to try assigning current box to given machine and not assign and recur for rest of thee boxes.
Note: A single machine can carry boxes multiple times , Each round trip takes exactly 1 unit time.
| Report Duplicate | Flag | PURGE
Directi Software Engineer
Open Chat in New Window