Python Short Solution
The largest element position should be  i<=j where s[i]=t[j]\n\n\nclass Solution:\n    def isTransformable(self, s: str, t: str) -> bool:\n        if sorted(s)!
The largest element position should be  i<=j where s[i]=t[j]\n\n```\nclass Solution:\n    def isTransformable(self, s: str, t: str) -> bool:\n        if sorted(s)!=sorted(t):\n            return False\n        num=sorted(t)\n        while num:\n            v=num.pop()\n            i1=t.index(v)\n            i2=s.index(v)\n            if i1<i2:\n                return False\n            t=t[:i1]+t[i1+1:]\n            s=s[:i2]+s[i2+1:]\n        return True\n```
[]