Topic: stack-problem / Level: advanced

• 2101. Write a stack-based solution to implement a basic interpreter that evaluates simple mathematical expressions.
• 2102. Design a stack-based algorithm to find all Hamiltonian cycles in a graph.
• 2103. Implement a stack-based solution for solving the problem of finding the longest increasing subsequence in an array.
• 2104. Write a program to simulate a stack-based approach for solving the n-queens problem with a constraint on the number of moves.
• 2105. Create a stack-based system for solving the problem of partitioning a graph into strongly connected components.
• 2106. Design a stack-based approach to solve the maximum sum path in a binary tree.
• 2107. Implement a stack-based solution for solving the problem of finding the shortest path in a graph with negative weights (Bellman-Ford).
• 2108. Write a stack-based system to solve the problem of merging k sorted linked lists.
• 2109. Create a stack-based algorithm to solve the problem of finding the longest substring with distinct characters.
• 2110. Design a stack-based approach to find the minimum spanning tree in a weighted graph using Kruskals algorithm.
• 2111. Implement a stack-based solution for solving the problem of scheduling tasks on a multi-core processor with varying task priorities.
• 2112. Write a program to simulate a stack-based approach for solving the problem of finding the maximum product subarray in a list.
• 2113. Create a function that uses stacks to solve the problem of generating all unique combinations of elements that sum to a target.
• 2114. Design a stack-based algorithm to solve the maximum square submatrix problem using dynamic programming.
• 2115. Implement a stack-based solution for solving the problem of finding the maximum depth of a binary tree.
• 2116. Write a program to simulate a stack-based approach for solving the knapsack problem with fractional weights.
• 2117. Create a stack-based system to simulate a memory management system with multiple processes and shared resources.
• 2118. Design a stack-based approach to solve the maximum path sum in a matrix with restricted moves.
• 2119. Implement a stack-based solution for solving the coin change problem with an unlimited number of coins.
• 2120. Write a program to simulate a stack-based approach for solving the problem of finding the longest valid parentheses substring.
• 2121. Create a function that uses stacks to solve the problem of finding the minimum number of deletions to make a string palindrome.
• 2122. Design a stack-based algorithm to solve the "Word Break" problem using depth-first search.
• 2123. Implement a stack-based solution for solving the longest palindromic substring problem in O(n²) time.
• 2124. Write a stack-based system to solve the partition problem where the elements must be partitioned into two subsets with equal sums.
• 2125. Create a stack-based algorithm to solve the problem of scheduling tasks with varying deadlines and penalties for late tasks.
• 2126. Design a stack-based approach to solve the problem of finding the k-th largest element in a matrix.
• 2127. Implement a stack-based solution for solving the problem of finding the maximum sum of non-adjacent elements in a binary tree.
• 2128. Write a program to simulate a stack-based approach for solving the shortest path problem in an unweighted graph using depth-first search.
• 2129. Create a function that uses stacks to solve the "Jump Game" problem using dynamic programming.
• 2130. Design a stack-based algorithm to solve the problem of finding all articulation points in a graph using Tarjans algorithm.
• 2131. Implement a stack-based solution for solving the problem of finding the maximum square submatrix with all 1s in a binary matrix.
• 2132. Write a stack-based system to solve the problem of finding the longest common substring between two strings.
• 2133. Create a stack-based algorithm to solve the minimum cost path problem in a grid using dynamic programming.
• 2134. Design a stack-based approach to solve the longest path in a weighted graph using dynamic programming.
• 2135. Implement a stack-based solution for solving the matrix chain multiplication problem with dynamic programming.
• 2136. Write a program to simulate a stack-based approach for solving the problem of finding the largest rectangular submatrix with all 1s.
• 2137. Create a function that uses stacks to solve the problem of generating all valid combinations of n pairs of parentheses.
• 2138. Design a stack-based algorithm to solve the maximum flow problem in a flow network using the Edmonds-Karp algorithm.
• 2139. Implement a stack-based solution for solving the longest path in a binary tree with backtracking.
• 2140. Write a stack-based system to solve the problem of finding the maximum sum of non-overlapping subarrays in a circular array.
• 2141. Create a stack-based algorithm to solve the problem of finding the shortest path in a weighted grid using depth-first search.
• 2142. Design a stack-based approach to solve the problem of finding the longest common subsequence between two strings.
• 2143. Implement a stack-based solution for solving the traveling salesman problem with backtracking.
• 2144. Write a program to simulate a stack-based approach for solving the problem of partitioning a set into k subsets with equal sums.
• 2145. Create a function that uses stacks to solve the problem of finding the number of unique paths in a grid with obstacles.
• 2146. Design a stack-based algorithm to solve the problem of finding the k-th largest element in a binary search tree.
• 2147. Implement a stack-based solution for solving the minimum cost to paint houses problem using dynamic programming.
• 2148. Write a stack-based system to solve the problem of finding all strongly connected components in a directed graph using Tarjans algorithm.
• 2149. Create a stack-based algorithm to solve the problem of finding the minimum number of coins needed to make a certain amount of change.
• 2150. Design a stack-based approach to solve the "Maximal Rectangle" problem using dynamic programming.

• More Levels

• Beginner
• Intermediate