Plane Seating Hackerrank Test

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Plane Seating Hackerrank Test. Start with the requirements on the right.

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

You need to log in / sign up to run or submit.

Problem

Seats on a plane hackerrank type test, abusive hiring practice

Implement max_family_groups(n, reserved_seats) to return the maximum number of four-person families that can be seated. Each row has seats A through J; a family may use B-E, D-G, or F-I. Overlapping blocks cannot both be selected in one row. Rows without reservations can seat two families.

Examples: n = 4, reserved_seats = ["1A", "2E", "4H"] returns 6; n = 1, reserved_seats = ["1D", "1G"] returns 0.

Input: integer n and a list of unique seat labels. Output: an integer.

Constraints

1 <= n <= 5000
0 <= len(reserved_seats) <= 10^4
Each seat label uses a row number from 1 through n followed by one letter from A through J
All reserved seat labels are unique
A family occupies exactly one of B-E, D-G, or F-I

Function Signature

def max_family_groups(n, reserved_seats):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output