Back to Practice Dashboard
DSA SectionEasy
Queue using Array
Learn how to solve the 'Queue using Array' problem. This detailed resource details brute force and optimized approaches.
Problem Statement
Easy
Write a function execute_queue_operations(operations) that simulates a Queue using an array. The input is a list of tuples operations where each tuple is either ("enqueue", val) or ("dequeue",). Return a list of dequeued values. If dequeued from empty queue, return None.
Constraints
- •0 <= len(operations) <= 1000
Examples
Example 1
Input
operations = [("enqueue", 1), ("enqueue", 2), ("dequeue",), ("enqueue", 3), ("dequeue",)]Output
[1, 2]
Explanation
Enqueue 1, 2. Dequeue returns 1 (FIFO). Enqueue 3. Dequeue returns 2.
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.