Easy to Understand || mapping || sorting
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> sortJumbled(vector<int>& mapping, vector<int>& nums) {\n        unordered_map<int,int> mp;\n        vector<pair<int,int>> arr;\n\n        for(int i=0;i<mapping.size();i++)\n            mp[i]=mapping[i];\n        for(auto it:nums){\n            string str = to_string(it);\n            int converted=0;\n            for(int i=0;i<str.length();i++)\n                converted = converted*10 + mp[str[i] - \'0\'];\n            arr.push_back({converted,it});\n        }\n        sort(arr.begin(),arr.end(),[](const pair<int,int> &lhs,const pair<int,int> &rhs){\n            return lhs.first < rhs.first;\n        });\n        vector<int> ans;\n        for(auto it:arr)\n            ans.push_back(it.second);\n        return ans;\n    }\n};\n```
['C++']