Scribd
Upload
8 views3 pages

Stack and Queue Coding Challenges

The document presents a set of programming problems focused on stack and queue data structures. It includes tasks such as reversing words using a stack, validating parentheses, implementing queues with stacks, and converting infix to postfix expressions. Each problem is accompanied by input and output examples to illustrate the expected functionality.

Uploaded by

nurerenerafi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views3 pages

Stack and Queue Coding Challenges

The document presents a set of programming problems focused on stack and queue data structures. It includes tasks such as reversing words using a stack, validating parentheses, implementing queues with stacks, and converting infix to postfix expressions. Each problem is accompanied by input and output examples to illustrate the expected functionality.

Uploaded by

nurerenerafi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Stack and Queue Problem Set

Reverse Individual Words Using Stack


Given a string, reverse each word in the string using a stack. For example, if the input is
'Hello World', the output should be 'olleH dlroW'.

Input Output
"Hello World" "olleH dlroW"

Balanced Parentheses
Given a string containing just the characters `(`, `)`, `{`, `}`, `[` and `]`, determine if the input
string is valid.

Input Output
"()[]{}" True
"(]" False

Reverse a Stack
Write a function to reverse the elements of a stack using recursion. Do not use any other
data structures.

Input Output
push(1) -> push(2) -> push(3) -> reverse() 3 -> 2 -> 1

Queue Implementation Using Two Stacks


Implement a queue using two stacks, supporting the following operations: enqueue(x),
dequeue(), display(), isEmpty().

Input Output
enqueue(1) -> enqueue(2) -> dequeue() -> 1
display() -> isEmpty() False

Queue Reversal
Write a function to reverse a queue using recursion. Do not use any additional data
structures.

Input Output
enqueue(1) -> enqueue(2) -> enqueue(3) - 3 -> 2 -> 1
> reverseQueue()
Implement a Circular Queue
Implement a circular queue where elements can be added or removed in a circular manner.

Input Output
enqueue(1) -> enqueue(2) -> dequeue() -> 1 -> 3
enqueue(3)

Find the Middle Element of a Stack


Design a function to find the middle element of a stack. If there are two middle elements,
return the second one.

Input Output
push(1) -> push(2) -> push(3) -> push(4) - 3
> findMiddle()

Check for Palindrome Using Stack


Check if a string is a palindrome using a stack. Ignore spaces and case sensitivity.

Input Output
"A man a plan a canal Panama" True
"hello" False

Infix to Postfix Conversion


Write a function to convert an infix expression to postfix.

Input Output
"3 + 5 * 2" "3 5 2 * +"

Postfix Evaluation
Given a postfix expression, evaluate it and return the result.

Input Output
"3 5 2 * +" 13

Implement Stack Using Two Queues


Design a stack using two queues, supporting the following operations: push(x), pop(),
peek(), isEmpty().

Input Output
push(1) -> push(2) -> pop() -> display() -> 2
isEmpty() False
Sort a Stack
Sort a stack in ascending order using only a temporary stack.

Input Output
push(3) -> push(1) -> push(2) -> 1 -> 2 -> 3
sortStack()

You might also like