The Tail End

A easy Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

easy

Seniority

L3

Problem

Implement a stack and drive it through a list of operations. Define a `the_tail_end(operations)` driver. Each operation is a list whose first element is the operation name: ['push', x], ['pop'], ['peek'], or ['is_empty']. Replay the operations in order against a stack and return a parallel list of return values: None for push, the popped value (or None if the stack is empty) for pop, the top value (or None if empty) for peek, and True/False for is_empty. The stack must follow last-in, first-out (LIFO) ordering.

Summary

Push, pop, peek. The basics that break people.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.