
    Given a collection of delivery routes where each route contains a sequence of delivery stops for a driver, write a function to determine the minimum number of stops among all routes to identify the most efficient route in terms of delivery points. The routes are represented as lists of location IDs, where each inner list corresponds to a single driver's route.
    

    
def Find_Min_Length(lst):
    """
    Given a collection of delivery routes where each route contains a sequence of delivery stops for a driver, write a function to determine the minimum number of stops among all routes to identify the most efficient route in terms of delivery points. The routes are represented as lists of location IDs, where each inner list corresponds to a single driver's route.
    

    """
def Find_Min_Length(lst):
    """
    Given a collection of delivery routes where each route contains a sequence of delivery stops for a driver, write a function to determine the minimum number of stops among all routes to identify the most efficient route in terms of delivery points. The routes are represented as lists of location IDs, where each inner list corresponds to a single driver's route.
    

    """
    minLength = min((len(x) for x in lst))
    return minLength