[Python] Simple counting solution
Time: O(N)\nSpace: O(N)\n\n    def isTransformable(self, s: str, t: str) -> bool:\n        def get_hist(s):\n            cnts = [0] * 10\n            hist = [[]
Time: O(N)\nSpace: O(N)\n```\n    def isTransformable(self, s: str, t: str) -> bool:\n        def get_hist(s):\n            cnts = [0] * 10\n            hist = [[] for _ in range(10)]\n            for i, c in enumerate(s):\n                n = int(c)\n                cnts[n] += 1\n                hist[n].append(list(cnts))\n            return hist\n        \n        shist = get_hist(s)\n        thist = get_hist(t)\n        for n in range(10):\n            if len(shist[n]) != len(thist[n]):\n                return False\n            for i in range(len(shist[n])):\n                for j in range(n+1, 10):\n                    if shist[n][i][j] < thist[n][i][j]:\n                        return False\n        return True\n```
[]