✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1\nTime complexity: O(nlog(n)). Space co
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)\n\n# Code #1\nTime complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def sortJumbled(self, m: List[int], a: List[int]) -> List[int]:\n        return sorted(a,key=(f:=lambda v,k=1:m[v%10]*k+f(v//10,k*10) if v else (k==1)*m[0]))\n```\n\n# Code #2\nTime complexity: $$O(n*log(n))$$. Space complexity: $$O(n)$$.\n```\nclass Solution:\n    def sortJumbled(self, m: List[int], a: List[int]) -> List[int]:\n        return sorted(a,key=lambda v:int(\'\'.join(str(m[int(c)]) for c in str(v))))\n```\n\n(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be \'true\' oneliners - please, remind about drawbacks only if you know how to make it better)
['Array', 'Recursion', 'Sorting', 'Python', 'Python3']