All challenges
Medium 0 solved 0% acceptance

Library Checkout System

Run a small library system: add copies, check books out with a three book limit, return them and answer queries.

What you'll learn

  • Track copies per title with a map
  • Track each member's books
  • Apply checks in the stated order

Problem

A school library tracks how many copies of each title are on the shelf and which titles each member holds. Titles and member names are single words. Process these operations in order:

  • add <title>: one more copy of the title goes on the shelf (no output).
  • checkout <member> <title>: if the member already holds 3 books, output LIMIT. Otherwise, if no copy is on the shelf, output UNAVAILABLE. Otherwise the member takes a copy and the output is OK. A member may hold several copies of the same title.
  • return <member> <title>: if the member holds that title, one copy goes back on the shelf and the output is OK; otherwise output ERROR.
  • available <title>: output the number of copies on the shelf.
  • books <member>: output how many books the member holds.

Implement library_checkout(operations).

Input

operations: The operations, processed in order.

Output

Return every output as a string, in the order they happen (numbers are written in base 10, like "2").

Constraints

0 ≤ number of operations ≤ 2,000

Titles and names have 1 to 20 letters or digits

Examples

Example 1
Input:
operations = ["add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"]

Expected output:
expected = ["OK", "UNAVAILABLE", "0", "OK", "OK"]
Input:
std::vector<std::string> operations = {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Expected output:
std::vector<std::string> expected = {"OK", "UNAVAILABLE", "0", "OK", "OK"};
Input:
string[] operations = new string[] {"add Dune", "checkout ana Dune", "checkout ben Dune", "available Dune", "return ana Dune", "checkout ben Dune"};

Expected output:
string[] expected = new string[] {"OK", "UNAVAILABLE", "0", "OK", "OK"};

Explanation

Ana takes the only copy, so Ben gets UNAVAILABLE and 0 copies are left. After Ana returns it, Ben gets it: ["OK", "UNAVAILABLE", "0", "OK", "OK"].

Example 2
Input:
operations = ["add A", "add B", "add C", "add D", "checkout kim A", "checkout kim B", "checkout kim C", "checkout kim D", "return kim D", "books kim"]

Expected output:
expected = ["OK", "OK", "OK", "LIMIT", "ERROR", "3"]
Input:
std::vector<std::string> operations = {"add A", "add B", "add C", "add D", "checkout kim A", "checkout kim B", "checkout kim C", "checkout kim D", "return kim D", "books kim"};

Expected output:
std::vector<std::string> expected = {"OK", "OK", "OK", "LIMIT", "ERROR", "3"};
Input:
string[] operations = new string[] {"add A", "add B", "add C", "add D", "checkout kim A", "checkout kim B", "checkout kim C", "checkout kim D", "return kim D", "books kim"};

Expected output:
string[] expected = new string[] {"OK", "OK", "OK", "LIMIT", "ERROR", "3"};

Explanation

Kim reaches 3 books, so the fourth checkout gives LIMIT; returning D fails with ERROR because Kim never got it, and Kim holds 3.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Use one map from title to shelf copies and one from member to the titles they hold.

Hint 2

Check the 3 book limit before checking the shelf.

Hint 3

A return only works if that title is in the member's list; remove just one copy of it.

Expected complexity

O(q) time, O(q) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.