Python (Simple LIS)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def kIncreasing(self, arr, k):\n        def dfs(nums):\n            vals = []\n\n            for x in nums:\n                k = bisect_right(vals,x)\n                if k == len(vals): vals.append(x)\n                else: vals[k] = x\n\n            return len(nums) - len(vals)\n\n        return sum([dfs(arr[i:len(arr):k]) for i in range(k)])\n\n\n\n        \n\n\n\n\n        \n```
['Python3']