Simple and Easy JAVA Solution , Beats 100%
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```\nclass Solution {\n    public int minDeletionSize(String[] strs) {\n        int n=strs.length;\n        int m=strs[0].length();\n        int ans=0;\n        boolean isDeleted[] =new boolean[m];\n        for(int i=1;i<n;i++){\n            for(int col=0;col<m;col++){\n                if(isDeleted[col] || strs[i-1].charAt(col)==strs[i].charAt(col))\n                    continue;\n                if(strs[i-1].charAt(col)>strs[i].charAt(col)){\n                        isDeleted[col]=true;\n                        ans++;\n                        i=0;\n                }\n                break;\n            }\n        }\n        return ans;\n    }\n}\n```
['Array', 'String', 'Java']