C++ Super Easy and Short Solution
\nclass Solution {\npublic:\n    bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {\n        unordered_map<int, vector<int> > m;\n        for (a
```\nclass Solution {\npublic:\n    bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {\n        unordered_map<int, vector<int> > m;\n        for (auto p : pieces)\n            m[p[0]] = p;\n        \n        vector<int> res;\n        for (auto a : arr) {\n            if (m.find(a) != m.end())\n                res.insert(res.end(), m[a].begin(), m[a].end());\n        }\n        \n        return arr == res;\n    }\n};\n```\n**Like it? please upvote...**
['C']