if you want to remove passenger from ArrayList using your passenger id, you can create your own delete function.

Copypublic void removeList(ArrayList<Passenger> passengerList, int passengerId) {
    for (int i = 0; i<passengerList.size(); i++) {
        if (passengerList.get(i).getId() == passengerId) {
            passengerList.remove(i);
        }
    }
}

You can use like this

Copy@Override
public void deletePassenger(ArrayList<Passenger> passengerList) {

    System.out.println("---Passengers list--");
    for (Passenger tempPassenger : passengerList) {
        System.out.println(tempPassenger);
        System.out.println("If you want to see options menu, enter 6");
    }

    System.out.println("Enter ID of passenger that you want to delete!");
    int id = scanner.nextInt();
    scanner.nextLine();

    System.out.println("---Passengers list--");
    removeList(passengerList, id);


}

I think it is unfortunate that insert and remove call size. While I understand that you would want to reject a bad index early in the function, calling size gives these functions the property that inserting/removing cost time linear in the size of the list, not linear in the index as may be expected (or hoped for). The out-of-range-ness could be detected during the (inevitable) iteration up to the insertion/removal index.

Generally data structures and algorithms should not print errors to System.out (where it may be mixed awkwardly in the middle of other output, or be invisible in GUI applications, etc, anyway it's a mixing of concerns), but report them to the caller.