Available question text
Count the number of contiguous subarrays whose elements all differ pairwise by at most 2 (equivalently max - min ≤ 2). With n up to 1e5, the core challenge is using a two-pointer/sliding-window and a data structure to maintain the window's min/max to count valid subarrays efficiently.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2762. Continuous Subarrays
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source