Python - Simulation
\nclass Solution:\n    def has_problem(self, s, N, delete):     \n        for j in range(N - 1):\n            a, b = s[j], s[j + 1]\n            for i in range(
```\nclass Solution:\n    def has_problem(self, s, N, delete):     \n        for j in range(N - 1):\n            a, b = s[j], s[j + 1]\n            for i in range(len(a)):\n                if delete[i] or a[i] == b[i]: continue\n                if a[i] < b[i]: break\n                delete[i] = True\n                return True       \n        return False\n    \n    def minDeletionSize(self, s: List[str]) -> int:          \n        delete = [False] * len(s[0])\n        count = 0\n        while self.has_problem(s, len(s), delete): count += 1\n        return count\n```
[]