Instructions

You are the Maître D' of a hotel restaurant. Your task is to manage the seating arrangements for the dining room according to the number of seats available today, number of reservations, and the "walk in" guests currently waiting to be seated. For the purposes of this exercise, seating is assigned by first available empty seat.

For this exercise, you have 6 different dining room organization challenges to complete.

1. Make Today's Seating Chart

Define the new_seating_chart(<size=22>) function that takes a size argument representing the number of seats that will be set in the dining room today. If no size is given, the function should return a seating chart with 22 seats. Seat values should have a placeholder of None to indicate they are available to assign to a guest.

2. Arrange Reservations

Define the arrange_reservations(<guest_names>) function with 1 parameter for a list of guest names. This represents the number of people who have places reserved in the dining room today.

This function should return a dict seating chart of default size (22 seats), with guests assigned to seats in the order they appear on the reservation list. All unassigned seats should be set to None. If there are no guests, an "empty" seating chart with all None placeholders should be returned.

3. Find All the "Empty" Seats

Define the find_all_available_seats(<seats>) function that takes 1 parameter (a seating chart dictionary) and returns a list of seat numbers that are available for guests that are currently waiting. If a seat is empty, It will be of None value in the dictionary. Occupied seats will have the name of the guest.

4. Current Empty Seating Capacity

Define the current_empty_seat_capacity(<seats>) function that takes 1 parameter - the dict of existing seat reservations. The function should return the total number of seats that are empty.

5. Should we wait?

Define the accommodate_waiting_guests(<seats>, <guests>) function that takes two parameters. The first parameter will be a seating chart dict. The second parameter will be a list of guests who have "walked in" unexpectedly. You'll first need to find out how many seats are available and whether or not you can even give the unannounced guests seats at this time.

If you do not have enough seats, return the seating chart dict unaltered.

If seats are available, assign the guests places on the seating chart, and return it updated. Tip: You can use previously defined functions to do the calculations for you.

6. Empty Seats

Define the empty_seats(<seats>, <seat_numbers>) function that takes two parameters. The first parameter will be a seating chart dictionary. The second parameter is a list of seat numbers you need to "free up" or empty -- that is, you need to assign the seat number value to None.

Return the dict of seats after updating the "to empty" seat values.