Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1121 with 13 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1121 # by problem number
lcpy gen -s divide_array_into_increasing_sequences # by problem name
nums sorted in non-decreasing order and an integer k, return true if this array can be divided into one or more disjoint increasing subsequences of length at least k, or false otherwise.
Input: nums = [1,2,2,3,3,4,4], k = 3
Output: true
Explanation: The array can be divided into two subsequences [1,2,3,4] and [2,3,4] with lengths at least 3 each.
Input: nums = [5,6,6,7,8], k = 3
Output: false
Explanation: There is no way to divide the array using the conditions required.
from itertools import groupby
class Solution:
# Time: O(n)
# Space: O(1)
def can_divide_into_subsequences(self, nums: list[int], k: int) -> bool:
max_freq = max(len(list(group)) for _, group in groupby(nums))
return max_freq * k <= len(nums)
| Time | Space |
|---|---|
| O(n) | O(1) |