DoorDash Interview Question

Question: Implement a stack data structure in Python that supports the following operations: push(element): Adds an element to the top of the stack. pop(): Removes and returns the element at the top of the stack. peek(): Returns the element at the top of the stack without removing it. is_empty(): Returns a boolean value indicating whether the stack is empty or not. You can use any appropriate data structure(s) to implement the stack.