C++,Hashmap,sets
\nclass Solution {\n   int toInt(string s){\n        int n=s.length();\n        int ans=0;\n        int mul=pow(10,n-1);\n        for(int i=0;i<n;i++){\n       
```\nclass Solution {\n   int toInt(string s){\n        int n=s.length();\n        int ans=0;\n        int mul=pow(10,n-1);\n        for(int i=0;i<n;i++){\n            ans+=(s[i]-\'0\')*mul;\n            mul/=10;\n        }\n        return ans;\n            \n    }\npublic:\n    vector<vector<string>> displayTable(vector<vector<string>>& ords) {\n        set<int>tables;\n        set<string>items;\n        map<pair<string,string>,int>orders;//{key:{food_item,table_no},value:item_count}};\n        for(auto elm:ords){\n            tables.insert(toInt(elm[1]));\n            items.insert(elm[2]);\n            orders[{elm[2],elm[1]}]++;\n        }\n        vector<string>header;\n        header.push_back("Table");\n        for(auto elm:items)\n            header.push_back(elm);\n        vector<string>v;\n        vector<vector<string>>res;\n        res.push_back(header);\n        for(auto table:tables){\n            v.clear();\n            v.push_back(to_string(table));\n            for(auto item:items)\n                v.push_back(to_string(orders[{item,to_string(table)}]));\n            res.push_back(v);\n            \n        }\n        return res;\n    }\n};\n```
['C', 'Ordered Set']