Implementing Stack or Queue | Dataford Interview Questions

Solve a coding challenge focused on data structures: how would you implement a stack or a queue?

Implement a stack using a Python list and process the supplied operations in order. Return the result of each pop and peek; return None when either operation is applied to an empty stack.

Function signature: def process_stack(operations):

Constraints

1 <= operations.length <= 1000
Each operation is either ["push", value], ["pop"], or ["peek"]
Push values are integers
An empty pop or peek returns None

Function Signature

def process_stack(operations):

Your question is Implementing Stack or Queue. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem