Java Easy Runnable code
class Solution {\n    public boolean isTransformable(String s, String t) \n    {\n        int[][] sr = new int[10][10];\n        int[][] tr = new int[10][10];\n
class Solution {\n    public boolean isTransformable(String s, String t) \n    {\n        int[][] sr = new int[10][10];\n        int[][] tr = new int[10][10];\n        int[] sc = new int[10];\n        int[] tc = new int[10];\n        boolean equal = true;\n        \n        for (int i = 0; i < s.length(); i++) \n        {\n            int ss = s.charAt(i) - \'0\';\n            int tt = t.charAt(i) - \'0\';\n            if (equal) \n            {\n                switch (Integer.compare(tt,ss)) \n                {\n                    case 1: return false; // cannot produce t > s\n                    case -1: equal = false;\n                }\n            }\n            // running frequencies of digits in s & t\n            sc[ss]++;\n            tc[tt]++;\n            // running inversions in s & t\n            for (int j = 9; j > ss; j--) \n                sr[ss][j] += sc[j];\n            \n            for (int j = 9; j > tt; j--)\n                tr[tt][j] += tc[j];\n        }\n        \n        \n        for (int i = 0; i < 9; i++)\n        {\n            if (sc[i] != tc[i]) \n                return false; // cannot modify digit count\n            \n            for (int j = i+1; j <= 9; j++) \n            {\n                if (tr[i][j] > sr[i][j]) \n                    return false;  // cannot add inversions\n            }\n        }\n        return true;\n        \n    }\n}
['Java']