Build Data Structure with TDD | Dataford Interview Questions

Given a requirement for a basic data structure, implement it from scratch using TDD at A tech-focused logistics.

Implement a LIFO stack without using Python's built-in stack behavior. Define run_stack_operations(operations), where each operation is ['push', value], ['pop'], ['peek'], or ['is_empty']; return one result per operation, using null when pop or peek is called on an empty stack. The implementation should support constant-time push, pop, and peek operations and should be structured so its behavior can be tested independently.

Constraints

0 <= operations.length <= 10^4
Each operation is one of ['push', value], ['pop'], ['peek'], or ['is_empty']
Values may be integers, strings, or null
The stack must not use list.pop(), collections.deque, or another built-in stack implementation

Function Signature

def run_stack_operations(operations):

Your question is Build Data Structure with TDD. 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

Given a requirement for a basic data structure, implement it from scratch using TDD at A tech-focused logistics.

Constraints

0 <= operations.length <= 10^4
Each operation is one of ['push', value], ['pop'], ['peek'], or ['is_empty']
Values may be integers, strings, or null
The stack must not use list.pop(), collections.deque, or another built-in stack implementation

Function Signature

def run_stack_operations(operations):

Your question is Build Data Structure with TDD. 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.