Schedule Ride Requests

Problem Statement

Schedule Ride Requests Problem Description At Uber, each driver maintains a queue of ride requests. Requests arrive one by one, and each new request may need to be inserted into a specific position in the queue, based on factors such as rider priority, promotions, or dispatch logic. When a new request is added to the queue at a given position: The existing requests at that position and beyond are shifted one spot to the right to make space. The queue always grows until all requests are inserted. Your task is to determine the final sequence of ride requests in the driver's queue after all insertions are completed. Examples Example 1: n = 5 index = [0, 1, 2, 1, 2] request = [0, 1, 2, 3, 4] Explanation: Step-by-step insertion process: Insert request 0 at position 0: [0] Insert request 1 at position 1: [0, 1] Insert request 2 at position 2: [0, 1, 2] Insert request 3 at position 1: [0, 3, 1, 2] Insert request 4 at position 2: [0, 3, 4, 1, 2] The final sequence is [0, 3, 4, 1, 2]. Example 2