Simple 1ms Java Solution Using Array
Code\n\nclass Solution {\n    public int minDeletionSize(String[] strs) {\n        int cnt=0,j=0;\n        boolean compared[]=new boolean[strs.length];\n       
# Code\n```\nclass Solution {\n    public int minDeletionSize(String[] strs) {\n        int cnt=0,j=0;\n        boolean compared[]=new boolean[strs.length];\n        for(int i=0;i<strs[0].length();i++){\n            boolean currCompared[]=new boolean[strs.length];\n            for(j=0;j<strs.length-1;j++){\n                if(!compared[j]){ \n                    if(strs[j].charAt(i)>strs[j+1].charAt(i)){\n                        cnt++;\n                        break;\n                    }\n                    else if(strs[j].charAt(i)<strs[j+1].charAt(i))\n                        currCompared[j]=true;\n                }\n            }\n            if(j==strs.length-1)\n                for(;j>0;j--) compared[j-1]|=currCompared[j-1];\n        }\n        return cnt;\n    }\n}\n```
['Java']