Airport Limousine

Problem Statement

Airport Limousine Problem Description A limousine service for an airport can transport multiple passengers simultaneously. On the return trip, the driver may pick up more passengers for the next journey to the airport. A map of passenger locations is represented as a square matrix. The matrix contains cells with initial values as follows: A value ≥ 0 signifies a path. A value of 1 indicates a passenger. A value of -1 signifies an obstruction. Movement rules are: The driver starts at (0, 0) and the airport is at (n-1, n-1). Movement towards the airport is either right (→) or down (↓) through valid path cells. After reaching (n-1, n-1), the driver returns to (0, 0) by moving left (←) or up (↑) through valid path cells. Upon passing through a path cell containing a passenger, the passenger is picked up. The cell then becomes an empty path cell (0). If there is no valid route between (0, 0) and (n-1, n-1), no passengers can be collected. Implement a function that returns the maximum number