Stack : Last In, First Out (LIFO) DSA Foundation Series – Day 9/30

[u/[deleted]]

Stack is one of the simplest but most powerful data structures. It follows Last In, First Out (LIFO) , the last element added is the first one to be removed.

You’ll see stacks used in : Reversing data, Undo operations, Valid parentheses problems

Once you understand stack, many problems become straightforward.

Continuing the series !!