Java Solution - Queue - Time complexity O(n)
\nclass Solution {\n    public boolean isTransformable(String s, String t) {\n        Queue<Integer>[] queues = new LinkedList[10];\n        for (int i = 0; i <
```\nclass Solution {\n    public boolean isTransformable(String s, String t) {\n        Queue<Integer>[] queues = new LinkedList[10];\n        for (int i = 0; i < 10; i++) {\n            queues[i] = new LinkedList<>();\n        }\n        for (int i = 0; i < s.length(); i++) {\n            queues[s.charAt(i) - \'0\'].offer(i);\n        }\n        for (char c : t.toCharArray()) {\n            if (queues[c - \'0\'].isEmpty()) {\n                return false;\n            }\n            int idx = queues[c - \'0\'].poll();\n            for (int i = 0; i < c - \'0\'; i++) {\n                if (!queues[i].isEmpty() && queues[i].peek() < idx) {\n                    return false;\n                }\n            }\n        }\n        return true;\n    }\n}\n```
[]