Most Optimal Trip Planner

HardPython

Problem

Implement public List buildMostOptimalTrip() to resolve as many customer complaints as possible: keep all orders for the same customer in a single trip (unless they can't all fit), prioritize Subscriber orders so they ship more quickly, never send orders marked fragile in the same trip as orders marked hazardous, and always move perishable goods directly to the front of the queue. Feel free to add other optimizations (e.g. multi-zone trips); document your data-structure decisions and decompose the code appropriately.

Asked in the Byteboard Code Implementation Exercise, Task 3 of the readme. Competing constraints are expected, and you are not expected to finish every possible optimization.

Function

def buildMostOptimalTrip(orders):

orders is a list of order objects, each represented as a JSON object with fields: customerId, isSubscriber, isFragile, isHazardous, isPerishable, and zone.

Return a list of orders in the chosen trip order. Preserve all valid orders, keep each customer's orders together when possible, and apply the priority rules above.

Constraints

1 <= len(orders) <= 10^4
0 <= customerId <= 10^9
isSubscriber, isFragile, isHazardous, isPerishable are booleans
zone is a string or null
Return all orders exactly once

Function Signature

def buildMostOptimalTrip(orders):

Asked in the Byteboard Code Implementation Exercise, Task 3 of the readme. Competing constraints are expected, and you are not expected to finish every possible optimization.

Function

def buildMostOptimalTrip(orders):

orders is a list of order objects, each represented as a JSON object with fields: customerId, isSubscriber, isFragile, isHazardous, isPerishable, and zone.

Return a list of orders in the chosen trip order. Preserve all valid orders, keep each customer's orders together when possible, and apply the priority rules above.