README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

1121. Divide Array Into Increasing Sequences (Hard)

Given a non-decreasing array of positive integers nums and an integer K, find out if this array can be divided into one or more disjoint increasing subsequences of length at least K.

 

Example 1:

Input: nums = [1,2,2,3,3,4,4], K = 3
Output: true
Explanation: 
The array can be divided into the two subsequences [1,2,3,4] and [2,3,4] with lengths at least 3 each.

Example 2:

Input: nums = [5,6,6,7,8], K = 3
Output: false
Explanation: 
There is no way to divide the array using the conditions required.

 

Note:

1. 1 <= nums.length <= 10^5
2. 1 <= K <= nums.length
3. 1 <= nums[i] <= 10^5

Related Topics

[Math]

Hints

Hint 1

Think in the frequency of the numbers and how this affects the number of sequences needed.

Hint 2

What is the minimum number of sequences we need to form? Considering frequency of the numbers.

Hint 3

Think about the least number of sequences to maximize the lengths.

Hint 4

The number of sequences needed is equal to the maximum frequency of an element.

Hint 5

How to put the other elements into sequences ? Think in a greedy approach.