C++ Solution || Map
\nclass Solution {\npublic:\n    bool isTransformable(string s, string t) {\n        vector<vector<int>> inx(10);\n        for(int i = 0; i < s.length(); i++) \
```\nclass Solution {\npublic:\n    bool isTransformable(string s, string t) {\n        vector<vector<int>> inx(10);\n        for(int i = 0; i < s.length(); i++) \n            inx[s[i]-\'0\'].push_back(i);\n        \n        vector<int> cnt(10, 0);\n        for(int i = 0; i < t.length(); i++) {\n            int d = t[i] - \'0\';\n            // check anagram\n            if(cnt[d] >= inx[d].size())\n                return false;\n            for(int k = 0; k < d; k++) {\n                if(cnt[k] < inx[k].size() && inx[k][cnt[k]] < inx[d][cnt[d]])\n                    return false;\n            }\n            cnt[d] += 1;\n        }\n        \n        return true;\n    }\n};\n\n// 1 1 9 1 9  \n// 1 9 1 1 9\n```
['C']