I got a long question whose gist was...

From a given array of integers, find minimum number of subarrays such that the difference between any two elements in the subarray is less than or equal to k (integer).

How to solve this problem?