dsa1 min read
Jump Game VI — Greedy + Monotonic Deque
Maximum score to reach end where each jump is 1..k steps. Monotonic deque (sliding window maximum) of DP values for O(n) solution.
Read →
Monotonic-deque
4 articles
dsa1 min read
Longest Subarray with Sum ≤ K — Monotonic Queue + Prefix
Find longest subarray with sum <= k. Build prefix sums, use monotonic deque for decreasing prefix sums to efficiently find left boundaries.
Read →
dsa2 min read
Sliding Window Maximum — Monotonic Deque
Find the maximum in each sliding window of size k using a monotonic decreasing deque storing indices.
Read →
dsa1 min read
Jump Game VI — DP + Monotonic Deque
Maximize score jumping through an array with window k by combining DP with a monotonic decreasing deque.
Read →