hashing C++ using set
\n\nclass Solution {\npublic:\n    int minDeletionSize(vector&A) {\n    unordered_sets;\n    for (int i = 1; i < A.size(); ++i) {\n        for (int  j = 0; j < 
```\n\n```class Solution {\npublic:\n    int minDeletionSize(vector<string>&A) {\n    unordered_set<int>s;\n    for (int i = 1; i < A.size(); ++i) {\n        for (int  j = 0; j < A[i].size(); ++j) {\n            if (s.find(j)!=s.end() || A[i - 1][j] == A[i][j]) \n            {\n                continue;\n            }\n            if (A[i - 1][j] > A[i][j]) {\n                s.insert(j);\n                i=0;\n            }\n            break;\n        }\n    }\n    return s.size();\n    }\n};
['Ordered Set']