Topic: stack-problem / Level: intermediate

• 1101. Write a program to push and pop elements from two stacks alternately, maintaining order.
• 1102. Create a function to check if a given expression with square brackets, curly brackets, and parentheses is balanced using a stack.
• 1103. Implement a function to simulate a priority-based task scheduler using stacks.
• 1104. Write a program to find the maximum product of elements in a stack after popping the top k elements.
• 1105. Design a function to calculate the result of a postfix expression with mixed operators and exponentiation.
• 1106. Implement a stack to store all Fibonacci numbers up to a given number using recursion.
• 1107. Write a program to reverse the order of elements in a stack by groups of k.
• 1108. Create a function to find the first non-repeating character in a string using a stack.
• 1109. Write a program to implement the Min-Stack, which supports push, pop, and finding the minimum element in constant time.
• 1110. Implement a function to evaluate a boolean expression in postfix notation using a stack.
• 1111. Write a program to simulate a stack-based approach for finding the maximum rectangle area in a binary matrix.
• 1112. Create a function to reverse every second pair of elements in a stack recursively.
• 1113. Write a program to implement a stack that supports pushing and popping of elements with priority.
• 1114. Implement a function to solve the problem of finding the length of the longest valid substring of parentheses using a stack.
• 1115. Write a program to merge two sorted stacks without using any additional stack or array.
• 1116. Create a function to find the first element greater than the current element in a circular array using a stack.
• 1117. Write a program to reverse every third element in a stack using a second stack.
• 1118. Implement a function to simulate a simple version of the undo/redo functionality for text editing using a stack.
• 1119. Write a program to simulate a card shuffling system using multiple stacks.
• 1120. Create a function to check whether a sequence of push/pop operations results in a given final stack configuration.
• 1121. Write a program to push numbers into a stack and find the maximum element in constant time.
• 1122. Implement a stack to convert a prefix expression to an infix expression.
• 1123. Write a program to evaluate a postfix expression with support for division and modulus operations.
• 1124. Create a function to simulate a stack-based queue using two stacks.
• 1125. Write a program to implement a stack-based solution to find the maximum sum of elements in a sliding window of size k.
• 1126. Implement a function to solve the Tower of Hanoi problem using three stacks.
• 1127. Write a program to check if a set of brackets can be balanced by removing at most one pair using a stack.
• 1128. Create a function to reverse the digits of a number using a stack of characters.
• 1129. Write a program to simulate a stack-based depth-first search algorithm with cycle detection in a graph.
• 1130. Implement a function to push elements into a stack and reverse the order of every other element.
• 1131. Write a program to evaluate an arithmetic expression with mixed operators, including exponentiation, using a stack.
• 1132. Create a function to simulate an efficient memory allocator using a stack-based approach.
• 1133. Write a program to merge two stacks in sorted order, ensuring no duplicates are present.
• 1134. Implement a function to find the largest rectangle area in a histogram where the heights are stored in a stack.
• 1135. Write a program to simulate a stack-based approach for managing browser navigation with multiple tabs.
• 1136. Create a function to reverse every second pair of elements in a stack without using any additional stack.
• 1137. Write a program to implement a basic calculator with support for nested parentheses using a stack.
• 1138. Implement a function to find the maximum depth of nested parentheses in a string using a stack.
• 1139. Write a program to push elements into a stack and find the next greater element in a circular array.
• 1140. Create a function to reverse the elements of a stack recursively, leaving every second element in place.
• 1141. Write a program to simulate a text editors undo/redo functionality with multiple levels of undo.
• 1142. Implement a function to reverse every fourth element in a stack using recursion.
• 1143. Write a program to find the minimum area of a rectangle formed under a histogram using a stack.
• 1144. Create a function to simulate a ticketing system where customers can cancel and reorder their tickets using stacks.
• 1145. Write a program to implement a stack-based approach to solve the stock span problem.
• 1146. Implement a function to evaluate a boolean expression in prefix notation using a stack.
• 1147. Write a program to reverse every second group of k elements in a stack using a second stack.
• 1148. Create a function to solve the problem of finding the smallest element on the left of each element in an array using a stack.
• 1149. Write a program to implement a stack-based approach for solving the problem of finding the largest rectangle in a binary matrix.
• 1150. Implement a function to simulate a depth-first traversal of a binary tree using a stack.

• More Levels

• Beginner
• Advanced