codeintuition-logo
Learning PathBlogsPremiumLogin
codeintuition-logo

Hide Index

Stack

0% completed

Introduction to stacks

Understanding the problem
Exploring a possible solution
Key properties of a stack
Overview of supported operations

Array implementation of stacks

Structure of an array based stack
Implementing the stack class using an array
Determining the size of the stack
Checking if the stack is empty
Accessing the top of the stack
Pushing an item onto the stack
Popping an item from the top of the stack
Design a stack using an array
Design two stacks in an array

Linked list implementation of stacks

Structure of a linked list based stack
Implementing the stack class using linked list
Determining the size of the stack
Checking if the stack is empty
Accessing the top of the stack
Pushing an item onto the stack
Popping an item from the top of the stack
Design a stack using a linked list

Infix, Postfix and Prefix notations

Understanding the infix notation
Understanding the postfix notation
Understanding evaluation of a postfix expression
Evaluate a postfix expression
Understanding the prefix notation
Understanding evaluation of a prefix expression
Evaluate a prefix expression
Understanding postfix to infix conversion
Convert postfix to infix
Understanding prefix to infix conversion
Convert prefix to infix
Understanding infix to postfix conversion
Convert infix to postfix
Understanding infix to prefix conversion
Convert infix to prefix
Understanding postfix to prefix conversion
Convert postfix to prefix
Understanding prefix to postfix conversion
Convert prefix to postfix
Evaluate an infix expression

Pattern: Reversal

Understanding the reversal pattern
Identifying the reversal pattern
Stack inversion
Reverse the string
Reverse an array
Reverse word order

Pattern: Closest occurrence

Understanding the previous closest occurrence pattern
Identifying the previous closest occurrence pattern
Preceding superior element
Preceding inferior element
Understanding the next closest occurrence
Identifying the next closest occurrence pattern
Succeeding superior element
Succeeding inferior element
Preceding superior element II
Succeeding inferior element II
Succeeding superior nodes
Retained rainwater
Largest rectangle area

Pattern: Sequence validation

Understanding the sequence validation pattern
Identifying the sequence validation pattern
Parentheses checker
Redundant parentheses
Balanced span

Pattern: Linear evaluation

Understanding the linear evaluation pattern
Identifying the linear evaluation pattern
Canonicalise path
String expansion

Technique: Min-Max stack

Design a min stack
Design a max stack

Assessments

Assessment 1
Assessment 2

Certificate

Certificate

Liking the course? Check our discounted plans to continue learning.

Subscribe now