Monotonic Stack problems

39 Monotonic Stack DSA practice problems on CampusCode, each with statement, examples and constraints.

379. Next Greater Node in Linked List Medium Linked List
389. Remove Nodes From Linked List (Monotonic Stack) Medium Linked List
402. Largest Rectangle in Histogram (Stack) Hard Linked List
411. Remove K Digits to Get Smallest Number (LL + Stack) Hard Linked List
589. Next Greater Element Easy Stack
590. Next Smaller Element Easy Stack
591. Previous Greater Element Easy Stack
592. Previous Smaller Element Easy Stack
593. Stock Span Problem Easy Stack
594. Next Greater Element I Easy Stack
595. Next Greater Element in Circular Array Easy Stack
605. Remove K Digits to Get Smallest Number Easy Stack
608. Next Greater Element II (Circular Array) Medium Stack
609. Daily Temperatures Medium Stack
610. Largest Rectangle in Histogram Medium Stack
611. Maximal Rectangle in Binary Matrix Medium Stack
614. 132 Pattern Medium Stack
615. Remove Duplicate Letters Medium Stack
616. Online Stock Span Medium Stack
617. Max Width Ramp Medium Stack
619. Sum of Subarray Minimums Medium Stack
620. Sum of Subarray Maximums Medium Stack
624. Maximum of Minimum for Every Window Size Medium Stack
629. Car Fleet Medium Stack
630. Remove Nodes From Linked List Medium Stack
631. Number of Visible People in Queue Medium Stack
645. Minimum Cost Tree From Leaf Values Medium Stack
646. Buildings With an Ocean View Medium Stack
654. Largest Rectangle in Histogram (Optimal) Hard Stack
655. Maximal Rectangle Hard Stack
660. Max Width Ramp (Optimal) Hard Stack
661. Count Submatrices With All Ones Hard Stack
662. Sum of Total Strength of Wizards Hard Stack
663. Number of Visible Pairs in a Queue Hard Stack
666. Shortest Unsorted Continuous Subarray Hard Stack
667. Find the Most Competitive Subsequence Hard Stack
680. Sum of Subarray Ranges Hard Stack
681. Steps to Make Array Non-decreasing Hard Stack
684. Maximum Binary Tree (Monotonic Stack Build) Hard Stack