Plant Seat Reservation Problem | Dataford Interview Questions

Write a program to solve the plant seat reservation problem.

Implement plant_seat_reservation(n, reserved_seats) for rows numbered 1 through n, with seats A through H, J, and K; seat I does not exist. Return the maximum number of non-overlapping four-seat groups that can be formed.

Each group must occupy ABCD, DEFG, or GHJK. reserved_seats contains strings such as "12C", and no seat appears more than once.

Input and Output

n is an integer, reserved_seats is a list of strings, and the function returns an integer.

Constraints

1 <= n <= 10^9
0 <= len(reserved_seats) <= 2 * 10^5
Each reservation has the form row number followed by one seat letter
Valid seat letters are A, B, C, D, E, F, G, H, J, and K
No seat is reserved more than once

Function Signature

def plant_seat_reservation(n, reserved_seats):

Your question is Plant Seat Reservation Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem