Simplest implementation of Stacks with Arrays in Data Structure

Stacks are basically a data structure that works on the philosophy of FILO (First In and Last Out) or LIFO (Last In and First Out) and what this means is that when you stack data or values one after each other, the top most or the last element to be pushed/inserted will be the first element to be popped out or removed. The video demonstration below will illustrate this scenario with a nice example of notebooks stacked one after each other. If you’re not sure how to work with For loops and Arrays, I’d suggest you to watch the previous tutorial from here and come back to this one because that course will be covering the basic foundation or concept we will be building our code upon. If you like to download/view the presentation you can do so from here.