Shortest DP
Code\n\nclass Solution:\n    def minimumWhiteTiles(self, floor: str, numCarpets: int, carpetLen: int) -> int:\n        @cache\n        def dp(i, car):\n        
# Code\n```\nclass Solution:\n    def minimumWhiteTiles(self, floor: str, numCarpets: int, carpetLen: int) -> int:\n        @cache\n        def dp(i, car):\n            if i >= len(floor): return 0\n            if car == 0: return dp(i+1, car)+int(floor[i]==\'1\')\n            return min(dp(i+1, car)+int(floor[i]==\'1\'), dp(i+carpetLen, car-1))\n        return dp(0, numCarpets)\n```
['Python3']