Minumum White Tiles
\n# Code\n\npublic class Solution {\n    public int MinimumWhiteTiles(string floor, int numCarpets, int carpetLen) {\n        int n = floor.Length;\n           
\n# Code\n```\npublic class Solution {\n    public int MinimumWhiteTiles(string floor, int numCarpets, int carpetLen) {\n        int n = floor.Length;\n            int[,] dp = new int[n + 1, numCarpets + 1];\n\n            for (int i = 1; i <= n; ++i)\n            {\n                for (int k = 0; k <= numCarpets; ++k)\n                {\n                    int jump = dp[i - 1, k] + (floor[i - 1] - \'0\');\n                    int cover = k > 0 ? dp[Math.Max(0, i - carpetLen), k - 1] : 1000;\n                    dp[i, k] = Math.Min(cover, jump);\n                }\n            }\n            return dp[n, numCarpets];\n    }\n}\n```
['C#']