01 — problem
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit — LeetCode #?. Full problem statement, examples, and constraints live at https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit. DSAPatterns tracks this problem for pattern coverage and progress tracking.
02 — notes
Full examples and constraints live on the original LeetCode prompt. Use the link in the sidebar when you want the canonical statement.
03 — hints
Start by identifying the core monotonic queue idea that reduces the search space.
If you get stuck, check whether a standard monotonic queue technique applies here.