1) Implement Stack Data Structure in Java
2) Print the elements of a Stack
3) Find if the given set of open and closed parenthesis are valid, such that each open character
contains the corresponding closing character.
4) Reverse a Stack Using Iteration and Recursion
5) Sort Stacks
6) Create a Stack from a Queue
7) N Stack Problem
8) Max Element of a Stack
9) Use a Single Array to Implement 3 Stacks
10) Implement Queue using Stack
11) Reverse a Number using Stack
2) Print the elements of a Stack
3) Find if the given set of open and closed parenthesis are valid, such that each open character
contains the corresponding closing character.
4) Reverse a Stack Using Iteration and Recursion
5) Sort Stacks
6) Create a Stack from a Queue
7) N Stack Problem
8) Max Element of a Stack
9) Use a Single Array to Implement 3 Stacks
10) Implement Queue using Stack
11) Reverse a Number using Stack
Comments
Post a Comment