brute force
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    boolean delete[] = new boolean[101];\n    int ans = 0;\n    boolean flag = false;\n    for (int l = 0; l < strs[0].length(); l++) {\n      boolean deletec[] = new boolean[101];\n      for (int o = 0; o < delete.length; o++) {\n        deletec[o] = delete[o];\n      }\n      for (int i = 1; i < strs.length; i++) {\n        for (int j = 0; j < strs[0].length(); j++) {\n          if (!delete[j]) {\n            if (strs[i].charAt(j) < strs[i - 1].charAt(j)) {\n              deletec[j] = true;\n            } else if (strs[i].charAt(j) == strs[i - 1].charAt(j)) {\n              continue;\n            } else {\n              break;\n            }\n          }\n        }\n      }\n      for (int i = 0; i < delete.length; i++) {\n        if (delete[i] != deletec[i]) {\n          flag = true;\n        }\n      }\n      if (flag) {\n        delete = deletec;\n        continue;\n      } else break;\n\n    }\n    for (int i = 0; i < delete.length; i++) {\n      if (delete[i]) ans++;\n    }\n\n    return ans;\n  }\n}\n```
['Java']