c++ || MAP || easy
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    bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) \n    {\n        map<int,vector<int>> mp; \n        for(auto i:pieces) \n            mp[i[0]] = i;\n        vector<int> result;\n        for(auto a:arr) \n        {\n            if(mp.find(a)!=mp.end()) \n                result.insert(result.end(),mp[a].begin(),mp[a].end());\n        }\n        return result ==arr;\n    }\n};\n```
['C++']