Company: Amazon_4sep
Difficulty: medium
Drone Delivery Minimum Time Problem Description Amazon is expanding its next-generation drone delivery network, consisting of m hubs arranged in a circular ring (Hub 1 is adjacent to Hub m ). A drone can move to either adjacent hub, and the travel time between Hub i and its neighbors is given by transitionTime[i] . Amazon receives a list of priority delivery requests, where packages must be picked up or delivered to specific hubs in a given sequence, represented by the array requestedHubs . Starting from Hub 1, your task is to calculate the minimum total travel time required for the drone to fulfill all delivery requests. Note: Use 1-based indexing. Complete the function getMinimumTime in the editor below. getMinimumTime takes the following parameter(s): int requestedHubs[n] : the sequence of hubs to be visited int transitionTime[m] : the time taken by the drone to move from each hub to one of its adjacent hub Returns: long : the minimum total time required to visit all the requested h