Evaluate the spatial complexity of your solution.

The space complexity of a solution is an estimate of the amount of memory that an algorithm or component occupies depending on the size of the input data.

For example, if you have a function that processes an array of n elements and creates an additional array of the same size, then the space complexity is O(n).

If the algorithm uses a fixed number of variables and does not create new structures, then the space complexity is O(1).

In frontend development, it is important to consider how much data is stored in the state, how many elements are rendered, and how this affects the browser's memory consumption.