Simple Python O(n) Easy to Understand
\nclass Solution:\n    def isTransformable(self, s: str, t: str) -> bool:\n        if Counter(s) != Counter(t): return False\n        counter_s = Counter()\n   
```\nclass Solution:\n    def isTransformable(self, s: str, t: str) -> bool:\n        if Counter(s) != Counter(t): return False\n        counter_s = Counter()\n        counter_t = Counter()\n        \n        count = Counter()\n        for val in s:\n            val = int(val)\n            for larger in range(val+1, 10):\n                counter_s[val, larger] += count[larger]\n            count[val] += 1\n        \n        count = Counter()\n        for val in t:\n            val = int(val)\n            for larger in range(val+1, 10):\n                counter_t[val, larger] += count[larger]\n            count[val] += 1\n        \n        for pair in counter_t:\n            if counter_t[pair] > counter_s[pair]:\n                return False\n        \n        return True\n```
[]