Topic: Monotonic Stack

alleasymediumhard

alltodoattemptedfailedsolved

53 problems

#	Title	Status	Difficulty	Topics	Accept
42	Trapping Rain Water	—	Hard	ArrayTwo PointersDynamic Programming	65%
84	Largest Rectangle in Histogram	—	Hard	ArrayStackMonotonic Stack	47%
85	Maximal Rectangle	—	Hard	ArrayDynamic ProgrammingStack	53%
316	Remove Duplicate Letters	—	Medium	StringStackGreedy	51%
321	Create Maximum Numberread	—	Hard	ArrayTwo PointersStack	32%
402	Remove K Digitsread	—	Medium	StringStackGreedy	35%
456	132 Patternread	—	Medium	ArrayBinary SearchStack	34%
496	Next Greater Element I	—	Easy	ArrayHash TableStack	74%
503	Next Greater Element IIread	—	Medium	ArrayStackMonotonic Stack	66%
581	Shortest Unsorted Continuous Subarray	—	Medium	ArrayTwo PointersStack	37%
654	Maximum Binary Tree	—	Medium	ArrayDivide and ConquerStack	86%
739	Daily Temperatures	—	Medium	ArrayStackMonotonic Stack	67%
768	Max Chunks To Make Sorted II	—	Hard	ArrayStackGreedy	54%
853	Car Fleet	—	Medium	ArrayStackSorting	53%
901	Online Stock Spanread	—	Medium	StackDesignMonotonic Stack	67%
907	Sum of Subarray Minimums	—	Medium	ArrayDynamic ProgrammingStack	38%
962	Maximum Width Ramp	—	Medium	ArrayTwo PointersStack	56%
975	Odd Even Jumpread	—	Hard	ArrayDynamic ProgrammingStack	41%
1008	Construct Binary Search Tree from Preorder Traversal	—	Medium	ArrayStackTree	83%
1019	Next Greater Node In Linked List	—	Medium	ArrayLinked ListStack	62%
1081	Smallest Subsequence of Distinct Characters	—	Medium	StringStackGreedy	62%
1124	Longest Well-Performing Interval	—	Medium	ArrayHash TableStack	36%
1130	Minimum Cost Tree From Leaf Values	—	Medium	ArrayDynamic ProgrammingStack	68%
1475	Final Prices With a Special Discount in a Shop	—	Easy	ArrayStackMonotonic Stack	83%
1504	Count Submatrices With All Onesread	—	Medium	ArrayDynamic ProgrammingStack	57%
1526	Minimum Number of Increments on Subarrays to Form a Target Arrayread	—	Hard	ArrayDynamic ProgrammingStack	72%
1574	Shortest Subarray to be Removed to Make Array Sortedread	—	Medium	ArrayTwo PointersBinary Search	51%
1673	Find the Most Competitive Subsequence	—	Medium	ArrayStackGreedy	52%
1776	Car Fleet IIread	—	Hard	ArrayMathStack	56%
1793	Maximum Score of a Good Subarrayread	—	Hard	ArrayTwo PointersBinary Search	64%
1856	Maximum Subarray Min-Productread	—	Medium	ArrayStackMonotonic Stack	39%
1944	Number of Visible People in a Queue	—	Hard	ArrayStackMonotonic Stack	71%
1996	The Number of Weak Characters in the Gameread	—	Medium	ArrayStackGreedy	44%
2030	Smallest K-Length Subsequence With Occurrences of a Letterread	—	Hard	StringStackGreedy	39%
2104	Sum of Subarray Rangesread	—	Medium	ArrayStackMonotonic Stack	60%
2281	Sum of Total Strength of Wizardsread	—	Hard	ArrayStackMonotonic Stack	28%
2289	Steps to Make Array Non-decreasingread	—	Medium	ArrayLinked ListStack	23%
2334	Subarray With Elements Greater Than Varying Thresholdread	—	Hard	ArrayStackUnion Find	44%
2454	Next Greater Element IV	—	Hard	ArrayBinary SearchStack	40%
2487	Remove Nodes From Linked Listread	—	Medium	Linked ListStackRecursion	74%
2617	Minimum Number of Visited Cells in a Gridread	—	Hard	ArrayDynamic ProgrammingStack	23%
2736	Maximum Sum Queriesread	—	Hard	ArrayBinary SearchStack	28%
2818	Apply Operations to Maximize Scoreread	—	Hard	ArrayMathStack	54%
2865	Beautiful Towers Iread	—	Medium	ArrayStackMonotonic Stack	43%
2866	Beautiful Towers IIread	—	Medium	ArrayStackMonotonic Stack	34%
2940	Find Building Where Alice and Bob Can Meetread	—	Hard	ArrayBinary SearchStack	52%
2945	Find Maximum Non-decreasing Array Lengthread	—	Hard	ArrayBinary SearchDynamic Programming	17%
3113	Find the Number of Subarrays Where Boundary Elements Are Maximum	—	Hard	ArrayBinary SearchStack	31%
3229	Minimum Operations to Make Array Equal to Targetread	—	Hard	ArrayDynamic ProgrammingStack	39%
3420	Count Non-Decreasing Subarrays After K Operationsread	—	Hard	ArrayStackSegment Tree	20%

Page 1 of 2