tags: sliding window algorithms deque
The sliding window problem seeks to evaluate properties about every possible subarray without introducing a look-back penalty. In particular, the Maximum Sliding Window problem tries to find the maximum element in every contiguous fixed-length subarray.
Welcome to my problem solving blog! Here, you’ll find posts about interesting problems and riddles I’ve encountered as well as how I solved them.