#2294 - Partition Array Such That Maximum Difference Is K

Medium • View on LeetCode • View on GitHub

Problem Description

You are given an integer array nums and an integer k. You may partition nums into one or more subsequences such that each element in nums appears in exactly one of the subsequences.

Return the minimum number of subsequences needed such that the difference between the maximum and minimum values in each subsequence is at most k.

A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

Solution

/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var partitionArray = function(nums, k) {
  nums.sort((a, b) => a - b);
  let result = 1;
  let minValue = nums[0];

  for (let i = 1; i < nums.length; i++) {
    if (nums[i] - minValue > k) {
      result++;
      minValue = nums[i];
    }
  }

  return result;
};