Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 18 additions & 0 deletions data_structures/arrays/Deque.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
# Find maximum of every window of size k

Check failure on line 1 in data_structures/arrays/Deque.py

View workflow job for this annotation

GitHub Actions / ruff

Ruff (N999)

data_structures/arrays/Deque.py:1:1: N999 Invalid module name: 'Deque'
from collections import deque

arr = [1,3,-1,-3,5,3,6,7]
k = 3
dq = deque()
res = []

for i, val in enumerate(arr):
while dq and dq[0] <= i-k:
dq.popleft() # remove out-of-window indices
while dq and arr[dq[-1]] < val:
dq.pop() # remove smaller elements
dq.append(i)
if i >= k-1:
res.append(arr[dq[0]])

print(res) # [3, 3, 5, 5, 6, 7]
Loading