Python simple hashmap Solution
\n def displayTable(self, orders):\n        map_={}\n        res=[]\n        arr=[]\n        set_=set()\n        for i in range(0, len(orders)):\n            if
```\n def displayTable(self, orders):\n        map_={}\n        res=[]\n        arr=[]\n        set_=set()\n        for i in range(0, len(orders)):\n            if int(orders[i][1]) not in map_:\n                map_[int(orders[i][1])]=[orders[i][2]]\n            else:\n                map_[int(orders[i][1])].append(orders[i][2])\n        map_=sorted(map_.items(), key=lambda x:x[0])\n        for i in range(0, len(orders)):\n            set_.add(orders[i][2])\n        set_=list(set_)\n        set_.sort()\n        set_.insert(0,"Table")\n        res.append(set_)\n        # print(res)\n        for i in map_:\n            arr.append(str(i[0]))\n            for j in set_[1:]:\n                arr.append(str(i[1].count(j)))\n            res.append(arr)\n            arr=[]\n        # print(res)\n        return res\n        \n```
['Python', 'Python3']