Topic: stack-problem / Level: advanced

• 2151. Write a stack-based solution to find all topological sorts of a directed acyclic graph (DAG).
• 2152. Design a stack-based algorithm to find the longest increasing subsequence in a circular array.
• 2153. Implement a stack-based solution to solve the convex hull problem using the Graham scan algorithm.
• 2154. Write a program to simulate a stack-based approach for solving the word ladder problem with multiple dictionaries.
• 2155. Create a stack-based system to simulate a calendar system that tracks overlapping events and free time slots.
• 2156. Design a stack-based approach for solving the maximum rectangle problem in a 3D binary matrix.
• 2157. Implement a stack-based solution for solving the maximum path sum problem in a binary tree with node weights.
• 2158. Write a program to simulate a stack-based approach for solving the problem of finding the maximum product of non-adjacent elements.
• 2159. Create a function that uses stacks to solve the problem of finding the minimum cost to merge k sorted arrays.
• 2160. Design a stack-based algorithm to solve the word search problem in a matrix with depth-first search.
• 2161. Implement a stack-based solution for solving the balanced parentheses problem with additional constraints on nested parentheses.
• 2162. Write a program to simulate a stack-based approach for solving the Hamiltonian cycle problem using backtracking.
• 2163. Create a stack-based algorithm to solve the problem of partitioning a set into two subsets with the minimum difference in sums.
• 2164. Design a stack-based approach for finding the minimum cost to build roads between cities in a weighted graph.
• 2165. Implement a stack-based solution to solve the problem of finding the longest alternating subsequence in a sequence of integers.
• 2166. Write a program to simulate a stack-based approach for solving the k-SAT problem with depth-first search.
• 2167. Create a function that uses stacks to solve the problem of finding the longest valid path in a binary tree.
• 2168. Design a stack-based algorithm to solve the problem of finding the k-th largest element in a max heap.
• 2169. Implement a stack-based solution for solving the problem of finding the maximum XOR of two numbers in a stack.
• 2170. Write a program to simulate a stack-based approach for solving the maximum profit problem in stock trading with transaction fees.
• 2171. Create a stack-based system for solving the scheduling problem with tasks having start times, end times, and penalties for early completion.
• 2172. Design a stack-based approach to solve the problem of finding the largest subarray with a sum equal to k.
• 2173. Implement a stack-based solution for solving the "Balanced Partition" problem using dynamic programming.
• 2174. Write a program to simulate a stack-based approach for solving the problem of finding all subsets of an array that sum to a given value.
• 2175. Create a function that uses stacks to solve the problem of partitioning a graph into k subgraphs with minimal edge cuts.
• 2176. Design a stack-based algorithm to solve the problem of finding the shortest distance between any two nodes in a weighted graph.
• 2177. Implement a stack-based solution to solve the maximum product subarray problem using depth-first search.
• 2178. Write a program to simulate a stack-based approach for solving the problem of finding the minimum cost to travel between all cities in a graph.
• 2179. Create a stack-based algorithm to solve the "Word Ladder II" problem, finding all shortest transformation sequences from start to end.
• 2180. Design a stack-based approach for finding the minimum spanning tree of a graph using Prim’s algorithm.
• 2181. Implement a stack-based solution for solving the problem of finding the longest substring with at most two distinct characters.
• 2182. Write a program to simulate a stack-based approach for solving the problem of finding the minimum number of operations to make a string palindrome.
• 2183. Create a function that uses stacks to solve the problem of finding the maximum length of repeated subsequences in an array.
• 2184. Design a stack-based algorithm to solve the problem of finding the minimum number of vertex covers in a bipartite graph.
• 2185. Implement a stack-based solution for solving the "Max Area of Island" problem in a binary matrix using depth-first search.
• 2186. Write a program to simulate a stack-based approach for solving the problem of scheduling tasks with cooldown periods.
• 2187. Create a function that uses stacks to solve the problem of finding all k-combinations of an array with a sum divisible by m.
• 2188. Design a stack-based approach to solve the problem of finding the longest common prefix in an array of strings.
• 2189. Implement a stack-based solution for solving the matrix chain multiplication problem with a constraint on matrix dimensions.
• 2190. Write a program to simulate a stack-based approach for solving the problem of finding the longest subarray with an equal number of 0s and 1s.
• 2191. Create a function that uses stacks to solve the "Course Schedule II" problem, finding the order of courses to complete all prerequisites.
• 2192. Design a stack-based algorithm to solve the problem of finding the k-th smallest element in a matrix with sorted rows and columns.
• 2193. Implement a stack-based solution for solving the "Rod Cutting Problem" with a constraint on the maximum number of cuts.
• 2194. Write a program to simulate a stack-based approach for solving the problem of finding the maximum profit in stock trading with at most two transactions.
• 2195. Create a function that uses stacks to solve the "House Robber III" problem, finding the maximum sum of non-adjacent houses in a binary tree.
• 2196. Design a stack-based approach for finding all cycles in a directed graph using depth-first search.
• 2197. Implement a stack-based solution for solving the problem of finding the minimum cost to paint n houses with k colors.
• 2198. Write a program to simulate a stack-based approach for solving the "Palindrome Partitioning II" problem, finding the minimum cuts needed for partitioning a string into palindromic substrings.
• 2199. Create a function that uses stacks to solve the problem of finding the maximum number of meetings that can be scheduled in a single room.
• 2200. Design a stack-based algorithm to solve the problem of finding the maximum sum of elements in a k-length subarray using sliding windows.

• More Levels

• Beginner
• Intermediate