I’m trying to implement my own Stack class in Python. I want the stack to have dynamic resizing capabilities, similar to how Python’s lists automatically grow when needed. Specifically, when the stack reaches its current capacity, it should double in size, and when it shrinks below a certain threshold, it should reduce its size to save memory. How can I efficiently implement this dynamic resizing in a stack data structure? What are the best practices to follow?

My implementation works for basic cases, but I’m running into issues managing the resizing efficiently. Specifically:

• The resizing logic sometimes results in index errors.
• I’m not sure what the best threshold is for resizing (both growing and shrinking) to avoid excessive memory usage or resizing operations.