Reverse a word using Stack
Write a program to reverse a word using stack For example Solution Continue reading Reverse a word using Stack
Tag: Stack
Implement Stack using Queue
Write a program to demonstrate stack Implementation using Queue. Solution: Continue reading Implement Stack using Queue
Implement Stack using an Array
Write a program to demonstrate stack Implementation using an Array. Solution: Continue reading Implement Stack using an Array
Delete element from stack
Write a program to delete an element from a stack. Solution Continue reading Delete element from stack
Sort stack
Write a program to Sort a stack Solution: Continue reading Sort stack
Sort a stack using recursion
Write a program to Sort a stack using recursion Solution: Continue reading Sort a stack using recursion
Reverse Stack Implementation
Write a program to reverse stack. For example Solution Continue reading Reverse Stack Implementation
Stack Implementation using Linked List
Write a program to demonstrate stack Implementation using Linked List. Solution: Continue reading Stack Implementation using Linked List
Balanced Brackets – HackerRank Problem Solution
Question: A bracket is considered to be any one of the following characters: (, ), {, }, [, or ]. Two brackets are considered to be a matched pair if the an opening bracket (i.e., (, [, or {) occurs to the left of a closing bracket (i.e., ), ], or }) of the exact same type. There are three types of matched pairs of brackets: [], {}, and (). A matching pair of brackets is not balanced if the set of brackets it encloses … Continue reading Balanced Brackets – HackerRank Problem Solution