Python (Simple DP)
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```python3 []\nclass Solution:\n    def minimumWhiteTiles(self, floor, numCarpets, carpetLen):\n        n, k = len(floor), numCarpets\n\n        @lru_cache(None)\n        def function(i,k):\n            if i >= n:\n                return 0 \n\n            if k == 0:\n                return int(floor[i]) + function(i+1,k)\n\n            place = function(i+carpetLen,k-1)\n            dont = int(floor[i]) + function(i+1,k)\n            return min(place,dont)\n\n        return function(0,k)\n```
['Python3']