GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Patterns
  3. /Monotonic Deque
←All Patterns
StackEvidence Contributing

Monotonic Deque

Maintain a double-ended queue of candidate indices in monotonic order to answer sliding-window max/min in O(1) amortized.

Practice Problems: 2
Difficulty: 0 Easy·1 Medium·1 Hard

Core technique

Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.

  • Core Strategy: Maintain a double-ended queue of candidate indices in monotonic order to answer sliding-window max/min in O(1) amortized.

Canonical Practice Problems

2 problems
1.Maximum Sum Circular SubarrayMedium
Solve on LeetCode↗
2.Sliding Window MaximumHard
Solve on LeetCode↗

Curated Sheets Containing This Pattern

NeetCode All

2 problems

→

LeetCode Top Interview 150

1 problem

→

NeetCode 150

1 problem

→

Striver A2Z

1 problem

→

Striver SDE Sheet

1 problem

→

Related Algorithmic Patterns

Arrays1 shared

Kadane's Algorithm

Sliding Window1 shared

Sliding Window (Fixed Size)

Stack

Monotonic Decreasing Stack

Stack

Monotonic Increasing Stack

Stack

Stack-Based Matching / Evaluation

GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy