← Questions
Fewest days to deliver every order from distribution centers
0
I was asked this
No reports yet. Sign in to say where you were asked it.
There are N distribution centers numbered 1..N and a list of orders, each naming a destination city numbered like the centers. Each day a center can work on one order: delivering to its own city takes one day, delivering to any other city takes two. Return the fewest days needed to deliver all orders. For N = 3 and orders [1, 1, 3, 1, 1] the answer is 3.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding