Data Structures
/
Stack
LIFO
sequential
recursive
Code
Press play to start
C
C++
C#
Java
Python
Go
JavaScript
TypeScript
1
void
push
(
int
val
)
{
2
stack
[
+
+
top
]
=
val
;
3
}
Push
Pop
Peek
Search
RUN ▶
Step 1/0
0.25×
0.5×
1×
2×
4×
Practice
LeetCode
·
#20 Valid Parentheses
Easy
HackerRank
·
Maximum Element
Easy
NeetCode
·
Valid Parentheses
Easy
Complexity
About
Operation
Best
Average
Worst
push
O(1)
O(1)
O(1)
pop
O(1)
O(1)
O(1)
peek
O(1)
O(1)
O(1)
search
O(1)
O(n)
O(n)
Space
O(n)
