Skip to content

Instantly share code, notes, and snippets.

@vike27
Last active August 29, 2015 14:20
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save vike27/a9b750cbd2298c151bf5 to your computer and use it in GitHub Desktop.
Save vike27/a9b750cbd2298c151bf5 to your computer and use it in GitHub Desktop.
Hotel Bag Check-In Problem Set
Write a program for managing locker reservations at a hotel concierge desk.
Customers leave bags with the concierge, who then uses your program to determine
in which locker to place the bag. The program tells the concierge the number of
the locker in which to place the bag, and prints a ticket to give to the customer.
Upon return, the customer provides the ticket, and the concierge uses that to
look up the corresponding locker, retrieve the bag, and return it to the customer.
There are 1000 small lockers, 1000 medium sized lockers,
and 1000 large lockers (it’s a big Vegas hotel). You can assume that all
checked bags fit into one of these three sizes. The program should
always assign the smallest available locker that fits the bag.
@vike27
Copy link
Author

vike27 commented May 22, 2015

note * need to copy solution here sometime

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment