Python solu
We could say it is a kind of greedy approach.\nHowever, this solu has middle time complexity.\nCode:\n\nclass Solution:\n    def minDeletionSize(self, strs: Lis
We could say it is a kind of greedy approach.\nHowever, this solu has middle time complexity.\nCode:\n```\nclass Solution:\n    def minDeletionSize(self, strs: List[str]) -> int:\n        \n        for i in range(len(strs) - 1):\n            if strs[i] > strs[i+1]:\n                break\n        else:\n            return 0\n        \n        res = 0\n        i = 1\n        while(i < len(strs)):\n            if strs[i] < strs [i-1]:\n                for j in range(len(strs[i])):\n                    if strs[i][j] < strs[i-1][j]:\n                        strs = [strs[m][:j]+strs[m][j+1:] for m in range(len(strs))]\n                        break\n                i = 1\n                res += 1\n            else:\n                i += 1\n        return res\n```
['Greedy']