# Minimum Operations to Make the Array K-Increasing (LeetCode 2671)
## Approach
LIS on residue classes; answer = n - sum LIS.
## Edge cases
Empty level / single node / duplicates.
## Practice tip
State complexity before coding.
Interview prep: [Linkjob AI](https://www.linkjob.ai/).