C++ || Simple LIS solution
\nint kIncreasing(vector<int>& arr, int k) {\n        \n       int mx=0;     \n       for(int i=0;i<k;i++)\n        {\n            vector<int>v;\n            fo
```\nint kIncreasing(vector<int>& arr, int k) {\n        \n       int mx=0;     \n       for(int i=0;i<k;i++)\n        {\n            vector<int>v;\n            for(int j=i;j<arr.size();j+=k)\n            {\n                if(v.empty() || v.back()<=arr[j])\n                {\n                    v.push_back(arr[j]);\n                }\n                else   \n                {\n                    int ind= upper_bound(v.begin(),v.end(),arr[j])-v.begin();\n                    v[ind]=arr[j];\n                }\n            }\n            mx+=v.size();\n        }\n        return arr.size()-mx;\n    }\n```
['C']