Moving Day

Do not guess the problem

Moving Day is not enough information to infer a unique data-structures question. Ask whether it concerns moving boxes, scheduling, travel time, intervals, capacities, or a game, and request a small example with the expected output. Confirm whether items can be reordered, whether costs are additive, and what limits govern the solution.

Once the model is fixed, explain a direct baseline first. Scheduling with capacities may call for sorting or a heap; movement over locations may be shortest path; interval conflicts may use a sweep line; selecting a subset may be dynamic programming. State the invariant and exactly what quantity is minimized or maximized. Test empty input, one item, ties, impossible moves, and large numeric totals. The appropriate Big-O follows the confirmed formulation, not the title: be explicit about time and auxiliary space only after the input size and operations are defined. This clarification-first answer is stronger than presenting an unrelated memorized algorithm.

Complexity: For n moving jobs, ordering candidates by deadline or route cost is O(n log n) time and O(n) space when the schedule is retained.