Implement a Queue using a linked list

Easy

Implement a queue using a linked list by finishing the class blueprint below.

Recall that a queue is a First in First out data structure.

Your queue has to implement the following methods:

dequeue which will pop the next item from the queue
enqueue which will add an item to the queue
peek returns the item at the front of the queue.

Try it first

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

class Queue:
    def __init__(self):
        pass

    def enqueue(self, item: int):
        pass

    def dequeue(self) -> int:
        pass

    def peek(self) -> int:
        pass

1class Node:
2    def __init__(self, data):
3        self.data = data
4        self.next = None
5
6class Queue:
7    def __init__(self):
8        pass
9
10    def enqueue(self, item: int):
11        pass
12
13    def dequeue(self) -> int:
14        pass
15
16    def peek(self) -> int:
17        pass
18

Solution

5 Essential Stacks & Queues Coding Interview Problems

Master Stacks & Queues by trying the coding challenges below.

Want to confidently pass your next coding interview?

Stack Bash helps new and veteran software engineers master data structures and algorithms for technical interviews.