Leetcode 2762. Continuous Subarrays

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.