Easy | C++ | Using Map & Set | Explanation Included
```\nclass Solution {\npublic:\n    vector> displayTable(vector>& orders) {\n        map > mp; // Table Number - FoodItem - Count\n        set items; // Unique 
```\nclass Solution {\npublic:\n    vector<vector<string>> displayTable(vector<vector<string>>& orders) {\n        map<int, map<string, int> > mp; // Table Number - FoodItem - Count\n        set<string> items; // Unique Items\n        for(vector<string> cust : orders)\n        {\n            mp[stoi(cust[1])][cust[2]]++; //for each table, store the count of particular food\n            items.insert(cust[2]); // store the food item in set\n        }\n        int s = mp.size();\n        vector<vector<string> > ans(s+1); // resultant vector\n        ans[0].push_back("Table");   // Push I row\n        for(string food : items) ans[0].push_back(food); // Push Name of items in I row\n        int i = 1; // for each table, iterate in the map "mp"\n        for(auto x : mp)\n        {\n            ans[i].push_back(to_string(x.first));  //Push the table number as I column of each row\n            for(string food : items)   \n                ans[i].push_back(to_string(mp[x.first][food]));  // Push the count of each food\n            i++;  // update to next row\n        }\n        return ans; // return vector\n        \n    }\n};
['Sorting', 'Ordered Set']