Java Greedy LinkedList Beat 100%
\nclass Solution {\n    public boolean isTransformable(String s, String t) {\n        // check if smaller one before its target position and its current positio
```\nclass Solution {\n    public boolean isTransformable(String s, String t) {\n        // check if smaller one before its target position and its current position.\n        Queue<Integer>[] queues = new LinkedList[10];\n        int n = s.length();\n        for(int i=0;i<10;i++){\n            queues[i] = new LinkedList<Integer>();\n        }\n        for(int i=0;i<n;i++){\n            queues[s.charAt(i)-\'0\'].add(i);\n        }\n        \n        for(int i=0;i<n;i++){\n            int tNum = t.charAt(i)-\'0\';\n            // more than original string\n            if(queues[tNum].isEmpty()) return false;\n            int curPos = queues[tNum].poll();\n            for(int less=0;less<tNum;less++){\n                if(!queues[less].isEmpty()&&queues[less].peek()<curPos) return false;\n            }\n            \n        }\n        return true;\n    }\n}\n```
[]