Drone Delivery Minimum Time

Problem Statement

Drone Delivery Minimum Time Problem Description Amazon is expanding its next-generation drone delivery network. The network has m hubs, numbered 1 to m , arranged in a circular ring: Hub i is adjacent to Hub i - 1 and Hub i + 1 , and Hub 1 is adjacent to Hub m . Every hub has its own take-off time. Flying from Hub i to either of its two adjacent hubs takes transitionTime[i] seconds (hubs are numbered from 1 ). The time of one hop depends only on the hub the drone leaves, not on the hub it lands on and not on the direction. Amazon receives a list of priority delivery requests: the hubs in requestedHubs , of size n , must be visited in the given order. The drone starts at Hub 1 . To get from one requested hub to the next it may fly clockwise or counterclockwise around the ring, passing through any hubs on the way. If the next requested hub is the hub the drone is already at, that request takes 0 seconds. Find the minimum total travel time needed to visit all requested hubs in order. Comp