Very Beginner Friendly|| Bruteforce Approach
\n# Approach\n Describe your approach to solving the problem. \nReplace the numbers with mapping numbers as a string value beacuse we might loose zeros if we co
\n# Approach\n<!-- Describe your approach to solving the problem. -->\nReplace the numbers with mapping numbers as a string value beacuse we might loose zeros if we convert them as integers.then sort them on the basis of its int value.then replace the mapped values with original values using a reverse dictionary of mapping.\n# Complexity\n- Time complexity: $$O(n*log(n))$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nDon\'t use this code for interviews as interviewers may not satisfy with the answer.If you have a good approach please share with me.I am happy to learn.\n# please Upvote if you like\uD83D\uDE4C\uD83D\uDE4C`\n# Code\n```\nclass Solution:\n    def sortJumbled(self, mapping: List[int], nums: List[int]) -> List[int]:\n        for i in range(len(nums)):\n            c=\'\'\n            for j in str(nums[i]):\n                c=c+str(mapping[int(j)])\n            nums[i]=c\n        nums.sort(key=lambda x:int(x))\n        d={mapping[i]:str(i) for i in mapping}\n        for i in range(len(nums)):\n            c=\'\'\n            for j in str(nums[i]):\n                c=c+d[int(j)]\n            nums[i]=int(c)\n        return nums\n```
['Array', 'Hash Table', 'Sorting', 'Python3']