Learning Path
Blogs
Premium
Login
Send
Hide Index
Stack
0% completed
Introduction
What's the problem?
A possible solution
Properties of stack
Supported operations
Array implementation
Structure
Stack class
Size of the stack
Is stack empty
Top of the stack
Push an item onto the stack
Pop the item from the top of the stack
Design a stack using an array
Design two stacks in an array
Linked list implementation
Structure
Stack class
Size of the stack
Is stack empty
Top of the stack
Push an item onto the stack
Pop the item form the top of the stack
Design a stack using a linked list
Pattern: Reversal
Stack inversion
Reverse an array
Reverse the string
Reverse word order
Stack inversion II
Recursively reverse a stack
Pattern: Min-Max stack
Design a min stack
Design a max stack
Design a min stack II
Design a max stack II
Design a min stack III
Design a max stack III
Pattern: Closest occurrence
Succeeding superior element
Preceding inferior element
Succeeding inferior element II
Preceding superior element II
Succeeding superior nodes
Pattern: Postfix Expressions
Convert postfix to prefix
Convert postfix to infix
Evaluate a postfix expression
Pattern: Prefix Expressions
Convert prefix to postfix
Convert prefix to infix
Evaluate a prefix expression
Pattern: Infix Expressions
Convert infix to postfix
Convert infix to prefix
Evaluate an infix expression
Pattern: Sequence validation
Parentheses checker
Redundant parentheses
Pattern: Application
String expansion
Canonicalise path
Retained rainwater
Balanced span
Largest rectangle area
Assessments
Assessment 1
Assessment 2
Liking the course? Start a
FREE
trial to continue learning.
Start free trial