Continuous Subarrays - Problem
You are given a 0-indexed integer array nums. A subarray of nums is called continuous if:
Let i, i + 1, ..., j be the indices in the subarray. Then, for each pair of indices i <= i1, i2 <= j, we have 0 <= |nums[i1] - nums[i2]| <= 2.
Return the total number of continuous subarrays.
A subarray is a contiguous non-empty sequence of elements within an array.
Input & Output
Example 1 — Basic Case
$
Input:
nums = [5,4,2,4]
›
Output:
8
💡 Note:
Valid subarrays: [5], [4], [2], [4], [5,4], [4,2], [2,4], [4,2,4]. Invalid: [5,4,2] and [5,4,2,4] because |5-2|=3>2 → 8 total
Example 2 — Small Array
$
Input:
nums = [1,2,3]
›
Output:
6
💡 Note:
All subarrays are continuous: [1], [2], [3], [1,2], [2,3], [1,2,3] → 6 total
Example 3 — Large Differences
$
Input:
nums = [1,10,2]
›
Output:
3
💡 Note:
Valid subarrays: [1], [10], [2]. Invalid: [1,10], [10,2], [1,10,2] due to differences >2 → 3 total
Constraints
- 1 ≤ nums.length ≤ 105
- -109 ≤ nums[i] ≤ 109
Visualization
Tap to expand
💡
Explanation
AI Ready
💡 Suggestion
Tab
to accept
Esc
to dismiss
// Output will appear here after running code