How many segments have max − min ≤ k?

Middle PRO

Task

Given an array of numbers and a number k, count the number of contiguous subarrays where max − min ≤ k.

The rest of this answer, with code and interview follow-ups, is in the DevPrep app.

DevPrep turns these answers into one-minute challenges: what does this code print, find the bug, mock interviews. One challenge a day.