🐲 Another One Liner 🐉
Complexity
Time complexity:
O(nlog(n))Codeor over multibe lines
# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
$$O(nlog(n))$$


# Code
```python3
class Solution:
    def kIncreasing(self, arr: List[int], k: int) -> int:
        return len(arr)-sum([(d:=[1e10]),any(d.__setitem__(bisect_right(d,i),i)for i in arr[m::k] if i<d[-1] or d.append(i) ),len(d)][-1]for m in range(k))
```
or over multibe lines
```python3 []
class Solution:
    def kIncreasing(self, arr: List[int], k: int) -> int:
        return len(arr)-sum(
        [(d:=[1e10]),
        any(d.__setitem__(bisect_right(d,i),i) for i in arr[m::k] if i<d[-1] or d.append(i))
        ,len(d)][-1] for m in range(k))
```
['Python3']