Implement a Stack using a Linked List

Easy

Implement a stack using a singly Linked List.

Your Stack class should implement the following methods:

push - adds data to the stack
pop - Pops the last data out of the stack
peek - Returns the data at the top of the stack (keeps that data in the stack)

Try it first

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

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

class Stack:
    def __init__(self):
        pass

    def pop(self) -> int:
        pass

    def push(self, data):
        pass

    def peek(self) -> int:
        pass

Solution

6 Essential Stacks & Queues Coding Interview Problems

Master Stacks & Queues by trying the coding challenges below.

Previous LessonQueue Next LessonImplement Queue

Implement a Stack using a Linked List

Try it first

Solution

6 Essential Stacks & Queues Coding Interview Problems

Want to confidently pass your next coding interview?