Count the steady pour runs

HardArraysSliding windowQueues

A sensor records an integer temperature for each pour along a brewery tasting line. A steady run is a nonempty contiguous sequence containing between minPours and maxPours pours, inclusive, whose highest and lowest temperatures differ by at most tolerance. Count all steady runs. Distinct starting or ending positions count as different runs, even if their temperatures match. Do not rearrange the pours.

Example 1

INPUT[3,4,6,5], 2, 2, 3OUTPUT4

All three length-2 runs qualify. Of the two length-3 runs, only [4, 6, 5] has range at most 2. The total is four.

Example 2

INPUT[8,8,8], 0, 1, 3OUTPUT6

Three single pours, two length-2 runs, and one length-3 run all have temperature range zero.

Keep in mind

1 <= temperatures.length <= 20,000
Each temperature is an integer from -1,000,000 to 1,000,000.
0 <= tolerance <= 2,000,000
1 <= minPours <= maxPours <= temperatures.length
The count fits exactly in a JavaScript Number.

/** @param {number[]} temperatures
 *  @param {number} tolerance
 *  @param {number} minPours
 *  @param {number} maxPours
 *  @returns {number} */
function solve(temperatures, tolerance, minPours, maxPours) {
  // Count runs satisfying both temperature and length limits.
}

/** @param {number[]} temperatures
 *  @param {number} tolerance
 *  @param {number} minPours
 *  @param {number} maxPours
 *  @returns {number} */
function solve(temperatures, tolerance, minPours, maxPours) {
  // Count runs satisfying both temperature and length limits.
}

INPUT[3,4,6,5], 2, 2, 3

EXPECTED OUTPUT4

Public samples only. These checks do not award ranked points.

AFTER THE SOLVE

How the solution works.

Walk through a solution, check its time and space costs, and compare it with yours.

Checking your progress…

Count the steady pour runs

Example 1

Example 2

Keep in mind

How the solution works.

Related problems

Make room for a quiet shift

Flights with a precise mix