Inventory Management OOP design
- by rgamber
This was an OOP design and implementation interview question, which I came across on glassdoor.com.
Design and implement a inventory management system to minimize the number of
missed delivery dates while keeping costs to the company low.
Of course there is no right answer to this, but I am not sure I understand the question correctly and am wondering what would be a good answer.
Is this as simple as creating an undirected graph with nodes as the delivery points, and edges having weights as the cost of the delivery, and then use a single-source-shortest-path algorithm (like Dijkstras, or Bellman-Ford) on the graph?
Not sure if this type of question should be asked here,so let me know and I will delete it.