Almost LINQ one-liner.
Intuition\nI feel lazy and bored today.\n\n# Approach\n1. First I select tuples of three numbers: an original number, respective mapped number, index of the ori
# Intuition\nI feel lazy and bored today.\n\n# Approach\n1. First I select tuples of three numbers: an original `number`, respective `mapped number`, `index` of the original `number`.\n2. Then I sort them by `mapped number` value.\n3. And finally I select original `numbers` only.\n4. That\'s it.\n\n# Complexity\n- Time complexity:\n$$O(n log n)$$\n\n- Space complexity:\n$$O(n)$$\n\n# Code\n```\npublic sealed class Solution \n{\n    public int[] SortJumbled(int[] mapping, int[] nums) =>\n        nums\n            .Select(n => \n            {\n                var m = n == 0 ? mapping[0] : 0;\n                var j = 1;\n                var k = n;\n\n                while(n > 0) \n                {\n                    var c = n % 10;\n                    m = mapping[c] * j + m;\n                    n /= 10;\n                    j *= 10;\n                }\n\n                return (n: k, m: m, i: i);\n            })\n            .OrderBy(t => t.m)\n            .Select(t => t.n)\n            .ToArray();\n}\n```\n
['Array', 'Sorting', 'C#']