Python Solution w/ Hash Table
\nclass Solution:\n    def isTransformable(self, s: str, t: str) -> bool:\n        if Counter(s) != Counter(t): return False\n        \n        hs = defaultdict
```\nclass Solution:\n    def isTransformable(self, s: str, t: str) -> bool:\n        if Counter(s) != Counter(t): return False\n        \n        hs = defaultdict(lambda: deque())\n        for i, c in enumerate(s):\n            hs[int(c)].append(i)\n\n        for c in t:\n            v = int(c)\n            i = hs[v].popleft()\n            for j in range(v):\n                if j in hs and hs[j] and hs[j][0] < i:\n                    return False\n        return True\n```
[]