Tap here to switch tabs
Problem
Submissions

Problem: Count Subarrays With Fixed Bounds

Count Subarrays With Fixed Bounds counts contiguous array segments whose smallest value is minK and largest is maxK. Return the total number of such subarrays.

Statement

Given an integer array, nums, and two integers minK and maxK, return the number of fixed-bound subarrays.

A subarray in nums is called a fixed-bound subarray if it satisfies the following conditions:

  1. The smallest value in the subarray equals minK.

  2. The largest value in the subarray equals maxK.

Note: A subarray is a contiguous sequence of elements within an array.

Constraints:

  • 2≤2 \leq nums.length ≤103\leq 10^{3}

  • 1≤1 \leq nums[i], minK, maxK ≤103\leq 10^{3}

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Count Subarrays With Fixed Bounds

Count Subarrays With Fixed Bounds counts contiguous array segments whose smallest value is minK and largest is maxK. Return the total number of such subarrays.

Statement

Given an integer array, nums, and two integers minK and maxK, return the number of fixed-bound subarrays.

A subarray in nums is called a fixed-bound subarray if it satisfies the following conditions:

  1. The smallest value in the subarray equals minK.

  2. The largest value in the subarray equals maxK.

Note: A subarray is a contiguous sequence of elements within an array.

Constraints:

  • 2≤2 \leq nums.length ≤103\leq 10^{3}

  • 1≤1 \leq nums[i], minK, maxK ≤103\leq 10^{3}