I received an email with the link for an online assessment that I had one week to complete. I had to solve two problems in under 90 minutes on HackerRank.

1. 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].

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

Return long: the minimum total time required to visit all the requested hubs, considering the transition time of the drone.