Back to Practice Dashboard
DSA SectionEasy

Stack using Array

Learn how to solve the 'Stack using Array' problem. This detailed resource details brute force and optimized approaches.

Problem Statement

Easy

Write a function execute_stack_operations(operations) that simulates a Stack using an array. The input is a list of tuples operations where each tuple is either ("push", val) or ("pop",). Return a list of popped values.

Constraints
  • 0 <= len(operations) <= 1000

Examples

Example 1
Input
operations = [("push", 1), ("push", 2), ("pop",), ("push", 3), ("pop",)]
Output
[2, 3]
Explanation

Push 1, push 2. Pop returns 2. Push 3. Pop returns 3. Pops list is [2, 3].

Need a Hint?
Analyze the input constraints. Try sorting first (O(n log n)) or using a hash map/set to track seen elements in O(n) time.
Edge Cases to Watch
  • Empty list or null input variables
  • Single item lists/arrays
  • Extremely large input bounds causing integer or stack overflow

Ready to Solve?

Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.

Open in Editor