root0109 / parkinglot Goto Github PK

I have an query, how should I handle automatic bus seat allocation problem on similar lines to parking lot problem.
Problem description:

• There are 3 x 2( 3 by 2) seats in bus with X capacity.
• Each row contains 5 seats from which 2 seats are Window seats.

Conditions:

1. If I have given an input to system to book one seat then preference should go to window seat.
2. If I have given an input to system to book two seats then 2 seats from double seat( two seats section of 3 by 2 seats ) should be booked.
   and so on...
3. If no window seats are available then system should give preference to middle seats.

I have to implement something like NearestFirstParkingStrategy but not sure how to achieve same.
I would highly appreciate if I can get some idea on what collections/implementation strategy should be used and time complexity using same etc.