How to implement stack in Python using Deque | Step by Step code

In this video, you will learn how to implement a stack in python using Deque.

I have already made a video on how to implement stack in Python using list. You may want to check it out first -

A stack is a data structure in which elements are pushed inside the stack from the top and popped out from the top as well.

Stack stores elements on a LIFO basis (Last-In-First-Out) basis.

Stack is a data structure not available in Python hence, in this video I have implemented it using a Deque which promises to provide highly efficient, fast, memory efficient append and pop operations.

This is one of the frequently asked Python interview questions as well so you might want to follow along with me.

----------------------------------------------------
Important explanations
----------------------------------------------------
len() determines the length of the stack which in this program is a list. Subtracting 1 determines the last index

------------------
Also, Watch
-------------------
How to install Python on Mac

How to install Pycharm on Mac