Monotonic queue: window min/max with fixed window size. time. Segment tree with lazy propagation: arbitrary range queries, supports updates. time. Sparse table: static range min/max queries. preprocessing, query.
When you have a sliding window (fixed size, sequential iteration), monotonic queue is the cleanest and fastest. Use the others for more general range query problems.