#028Queue Implemented as Stack
dsa.easyDSA
1class TaskQueue:
2 def __init__(self):
3 self._tasks = []
4
5 def enqueue(self, task):
6 self._tasks.append(task)
7
8 def dequeue(self):
9 return self._tasks.pop()
10
11 def is_empty(self):
12 return len(self._tasks) == 0
no lines flagged
#028PracticeEasy8 min · 50 XP
Queue Implemented as Stack
A task queue processes jobs in LIFO order instead of FIFO, so the oldest jobs never execute.
Flagged lines
No lines flagged yet
What's wrong?
Flag a line or write a note to submit.