How does adding an element to a list work if its length has already reached maximum capacity in Python?

In Python, lists are implemented as dynamic arrays. When an element is added using the append() method, and the current array reaches its capacity, a new block of memory larger than the previous one is allocated, usually with some extra space to reduce the number of reallocations. Then, all elements are copied to the new block, and the new element is added. This allows efficient addition of elements, providing amortized constant time complexity for the operation.

Example:

lst = [1, 2, 3]
lst.append(4)  # If the current array is full, a new one with a larger size is allocated

Thus, the user does not notice the reallocation, and the list grows dynamically.