Practice/Google/Leetcode 1296. Divide Array in Sets of K Consecutive Numbers

Leetcode 1296. Divide Array in Sets of K Consecutive Numbers

CodingMust

Problem

You are given an array of integers nums and an integer k. Your task is to determine whether it's possible to divide the array into groups where:

• Each group contains exactly k elements
• Within each group, the elements form k consecutive integers (in any order)

Return true if such a partition exists, otherwise return false.

Requirements

1. Every element in the array must be used exactly once
2. Each group must contain exactly k consecutive integers
3. The total number of elements must be divisible by k
4. Elements within a group need not be adjacent in the original array

Constraints

• 1 ≤ nums.length ≤ 105
• 1 ≤ k ≤ nums.length
• 1 ≤ nums[i] ≤ 109
• The array length is guaranteed to be divisible by k

Examples

Example 1:

Input: nums = [1,2,3,3,4,4,5,6], k = 4 Output: true Explanation: We can form two groups: [1,2,3,4] and [3,4,5,6]

Example 2:

Input: nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3 Output: false Explanation: We have elements [1,2,3,3,3,4,4,5,9,10,11]. While we can form groups like [1,2,3], [2,3,4], [3,4,5], we cannot form a valid group containing 9 because we'd need 7 and 8 which don't exist.

Example 3:

Input: nums = [1,2,3,4,5], k = 5 Output: true Explanation: All elements form one consecutive group

Example 4:

Input: nums = [1,1,1,1], k = 1 Output: true Explanation: Each element forms its own group of size 1