Skip to main content
/Data Structures/Stack
1 / 8
Speed
ENES
/
Big O NotationRecursionTwo PointersSliding WindowSpace ComplexityMemoizationGreedy vs DP
StackQueueLinked ListHash TableBinary Search TreeHeap
Bubble SortSelection SortInsertion SortQuick SortMerge SortHeap SortCounting SortRadix SortShell Sort
Binary SearchLinear SearchJump SearchInterpolation Search
Breadth-First SearchDepth-First SearchDijkstra's AlgorithmPrim's AlgorithmTopological Sort
Fibonacci DPKnapsack 0/1Longest Common Subsequence
N-Queens ProblemSudoku SolverMaze Pathfinding
Tower of Hanoi
38 algorithms·by midudev
Stack · LIFO
Step 1:An empty Stack. LIFO: Last In, First Out — like a stack of plates.
Variables
size==0