> ## Documentation Index
> Fetch the complete documentation index at: https://leetcode-py.wisl.dev/llms.txt
> Use this file to discover all available pages before exploring further.

> ## Agent Instructions
> leetcode-py is a Python LeetCode practice environment generator with one CLI: lcpy. It is not a service or platform.
> Each problem is a directory under leetcode/ with README.md, solution.py, test_solution.py, helpers.py, and playground.ipynb. lcpy gen creates them from JSON templates bundled with the package.
> Examples are backed by tests; copy them verbatim.

# Design Parking System Python Solution

> Tested Python solution for LeetCode 1603 with 16 pytest cases. Generate a practice environment with lcpy.

LeetCode 1603, [Easy](/catalog/easy). Topics: [Design](/catalog/topics/design), [Simulation](/catalog/topics/simulation), [Counting](/catalog/topics/counting). [View on LeetCode](https://leetcode.com/problems/design-parking-system/description/).

Generate this problem as a practice environment: tested reference solution, 16 [parametrized pytest cases](/practice/testing), and a playground notebook:

```bash theme={"theme":{"light":"github-light","dark":"github-dark"}}
lcpy gen -n 1603   # by problem number
lcpy gen -s design_parking_system   # by problem name
```

## Problem

Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size.

Implement the `ParkingSystem` class:

* `ParkingSystem(int big, int medium, int small)` Initializes object of the `ParkingSystem` class. The number of slots for each parking space are given as part of the constructor.
* `bool addCar(int carType)` Checks whether there is a parking space of `carType` for the car that wants to get into the parking lot. `carType` can be of three kinds: big, medium, or small, which are represented by `1`, `2`, and `3` respectively. A car can only park in a parking space of its `carType`. If there is no space available, return `false`, else park the car in that size space and return `true`.

### Examples

```
Input
["ParkingSystem", "addCar", "addCar", "addCar", "addCar"]
[[1, 1, 0], [1], [2], [3], [1]]
Output
[null, true, true, false, false]

Explanation
ParkingSystem parkingSystem = new ParkingSystem(1, 1, 0);
parkingSystem.addCar(1); // return true because there is 1 available slot for a big car
parkingSystem.addCar(2); // return true because there is 1 available slot for a medium car
parkingSystem.addCar(3); // return false because there is no available slot for a small car
parkingSystem.addCar(1); // return false because there is no available slot for a big car. It is already occupied.
```

### Constraints

* `0 <= big, medium, small <= 1000`
* `carType` is `1`, `2`, or `3`
* At most `1000` calls will be made to `addCar`

**Follow up:** Can you implement the `ParkingSystem` class without storing the three capacities in separate variables?

## Solution

Reference implementation from [solution.py on GitHub](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_parking_system/solution.py), full suite in [test\_solution.py](https://github.com/wislertt/leetcode-py/blob/main/leetcode/design_parking_system/test_solution.py):

```python theme={"theme":{"light":"github-light","dark":"github-dark"}}
class ParkingSystem:
    # Time: O(1) per call
    # Space: O(1)
    def __init__(self, big: int, medium: int, small: int) -> None:
        self.spaces = [big, medium, small]

    def add_car(self, car_type: int) -> bool:
        if self.spaces[car_type - 1] == 0:
            return False
        self.spaces[car_type - 1] -= 1
        return True
```

## Complexity

| Time | Space |
| - | - |
| O(1) per call | O(1) |

## Tags

[NeetCode All](/catalog/neetcode).


This documentation is built and hosted on [Mintlify](https://mintlify.com), a developer documentation platform.