Scribd
Upload
0 views4 pages

Stack Interview Questions With Answers

The document provides a comprehensive list of stack interview questions and answers, categorized into basic, intermediate, and advanced levels. It covers fundamental concepts, real-world applications, operations, and various implementations of stacks, as well as problem-solving techniques using stacks. Additionally, it discusses language-specific usage and behavioral concepts related to stacks.

Uploaded by

amitkumargiri2005
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
0 views4 pages

Stack Interview Questions With Answers

The document provides a comprehensive list of stack interview questions and answers, categorized into basic, intermediate, and advanced levels. It covers fundamental concepts, real-world applications, operations, and various implementations of stacks, as well as problem-solving techniques using stacks. Additionally, it discusses language-specific usage and behavioral concepts related to stacks.

Uploaded by

amitkumargiri2005
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
You are on page 1/ 4

Stack Interview Questions with Answers

Basic Level (Conceptual + Simple Code)

1. What is a Stack?

A stack is a linear data structure that follows the LIFO (Last In First Out) principle.

2. List real-world applications of stacks.

Undo feature in text editors, call stack in recursion, backtracking algorithms, parsing expressions.

3. Differentiate between Stack and Queue.

Stack: LIFO, Queue: FIFO. Stack uses push/pop; Queue uses enqueue/dequeue.

4. Implement Stack using Arrays.

Use an array and a 'top' variable to track the last inserted element.

5. Implement Stack using Linked List.

Use a linked list where push inserts at the head and pop removes from the head.

6. What are the basic operations of a stack?

push(), pop(), peek(), isEmpty(), isFull() (only in arrays).

7. What is stack overflow and underflow?

Overflow: pushing to a full stack. Underflow: popping from an empty stack.

8. Check for balanced parentheses using stack.

Push opening brackets; on closing, check if the top is matching; if not, it's unbalanced.

9. Convert Infix to Postfix expression.

Use a stack to hold operators and follow operator precedence and associativity.

10. Evaluate a Postfix expression using a stack.

Scan tokens: push operands; on operator, pop two, apply, and push result.
Stack Interview Questions with Answers
Intermediate Level (Problem Solving)

1. Reverse a string using a stack.

Push all characters into a stack, then pop them back to reverse.

2. Implement two stacks in one array.

Use two tops: one starting from 0 and other from end of array moving inward.

3. Design a stack that supports getMin() in O(1) time.

Use an auxiliary stack to keep track of minimums.

4. Sort a stack using another stack.

Use a temporary stack and insert elements in sorted order.

5. Check if a string is a palindrome using stack.

Push half the string, compare with second half while popping.

6. Next Greater Element using stack.

Traverse from right, use a stack to keep potential next greater elements.

7. Stock Span Problem using stack.

Use stack to track previous higher prices' indices.

8. Implement a stack using queues.

Use two queues or a single queue with rotation logic.

9. Implement a queue using stacks.

Use two stacks one for enqueue, one for dequeue.

Advanced Level (Design & Optimization)

1. Design a stack with O(1) getMin()/getMax().

Maintain two stacks one for actual values and one for min/max values.
Stack Interview Questions with Answers

2. Largest Rectangle in Histogram using Stack.

Use a stack to keep indices of bars; calculate area using previous smaller bars.

3. Find the celebrity in a party using a stack.

Push all, pop two and compare; push possible celeb. Verify at end.

4. Redundant Brackets in an expression.

Use a stack and check for unnecessary brackets enclosing single operands.

5. Custom stack with middle element O(1).

Use a doubly linked list and a pointer to middle node with updates on push/pop.

6. Decode a string like 3[a2[c]].

Use stacks for numbers and strings; decode from inner to outer.

7. Sliding Window Maximum using Deque.

Maintain deque for indices in decreasing order; remove out-of-window elements.

Language-Specific (Java/Python/C++)

1. How to use built-in Stack class in Java?

Use java.util.Stack with methods like push(), pop(), peek().

2. Why is Deque preferred over Stack in Java?

Deque (like ArrayDeque) is faster and more modern; Stack is legacy class.

Behavioral/Conceptual Discussion

1. In which situations is stack preferred over recursion?

When we want to avoid call stack limitations or want explicit control over execution.

2. Can recursion be implemented using stack?


Stack Interview Questions with Answers
Yes, recursion can be simulated using an explicit stack.

3. What is the call stack?

A system stack that keeps track of active function calls in a program.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy