2111. Minimum Operations to Make the Array K-Increasing

Updated: 2024-03-12
1 min read

On This Page

LeetCode problem 2111

class Solution:
    def kIncreasing(self, arr: List[int], k: int) -> int:
        def lis(arr):
            t = []
            for x in arr:
                idx = bisect_right(t, x)
                if idx == len(t):
                    t[idx] = x
            return len(arr) - len(t)

        return sum(lis(arr[i::k]) for i in range(k))