C++ ✅|| Easy || Solution
\nclass Solution {\npublic:\n\tint minDeletionSize(vector<string>& s) {\n\t\tunordered_set<int> st;\n\t\tint n = s.size(), m = s[0].size();\n\t\tfor (int i = 1;
```\nclass Solution {\npublic:\n\tint minDeletionSize(vector<string>& s) {\n\t\tunordered_set<int> st;\n\t\tint n = s.size(), m = s[0].size();\n\t\tfor (int i = 1; i < n; ++i) {\n\t\t\tfor (int j = 0; j < m; ++j) {\n\t\t\t\tif (st.count(j) || s[i - 1][j] == s[i][j]) continue;\n\t\t\t\tif (s[i - 1][j] > s[i][j]) {\n\t\t\t\t\tst.insert(j);\n\t\t\t\t\ti = 0;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n        for(auto &e : st) cout<<e<<" ";\n\t\treturn st.size();\n\t}\n};\n```
['C']