Easy c++ solution || using set
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# 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```cpp []\nclass Solution {\npublic:\n    int minDeletionSize(vector<string>& strs) {\n        unordered_set<int> st;\n        for(int i = 1;i<strs.size();i++){\n            for(int j = 0;j<strs[i].size();j++){\n                if(st.count(j) > 0 || strs[i-1][j] == strs[i][j]) continue;\n                if(strs[i-1][j] > strs[i][j]){\n                    st.insert(j);\n                    i = 0;\n                }\n                break;\n            }\n        }\n        return st.size();\n    }\n};\n```
['Array', 'String', 'Greedy', 'Ordered Set', 'C++']