A monotonic queue is a specialized data structure that maintains elements in a specific order—either increasing or decreasing—as they are processed. Unlike a regular queue, where the order of elements strictly follows the sequence of insertion, a monotonic queue ensures that the elements are arranged in a way that optimizes certain operations, such as finding the minimum or maximum in a sliding window.

The monotonic queue pattern is crucial in solving problems where you need to efficiently manage a sliding window over a list of elements