Groups
Category
Level
SPFA is a queue-based optimization of Bellman–Ford that only relaxes edges from vertices whose distance just improved.
0-1 BFS is a shortest path algorithm specialized for graphs whose edge weights are only 0 or 1.
Sliding window is a technique that moves a contiguous segment (window) across an array or string while maintaining some running information like sum, count, or max.
A queue is a First-In-First-Out (FIFO) line where you add at the back and remove from the front in O(1) time.
A monotonic deque is a double-ended queue that keeps elements in increasing or decreasing order so that the front always holds the current optimum (min or max).