JavaScript Easy Solution | Beats 100% Faster | Beginner's Friendly :)
Code
# Code
```javascript []
const updateRepeat = (current, newAdded) => {
    for(let i=0;i<current.length;i++){
        current[i] = current[i] + newAdded[i];
    }    
    return current;
}

const displayTable = (orders) => {
    let items = new Set(orders.map((el) => el[2]).sort());
    let tableHead = ["Table", ...items], ans = [tableHead], merged = {};

    orders.forEach((el) => {
        let name = el[0], table = el[1], food = el[2];
        const key = `${name}-${table}`;
        if (!merged[key]) merged[key] = { name, table, foods: [food] };
        else merged[key].foods.push(food);
    });

    let rows = new Map();
    for(let key in merged){
        let arr = new Array(tableHead.length - 1).fill(0);
        let tableNum = key.split("-")[1];

        let foods = merged[key].foods;
        for(let i=0;i<foods.length;i++){
            let index = tableHead.indexOf(foods[i]) - 1;
            arr[index]++;
        }

        if(rows.has(tableNum)) arr = updateRepeat(rows.get(tableNum), arr);
        rows.set(tableNum, arr);
    }

    rows = new Map([...rows.entries()].sort((a, b) => a[0] - b[0]))
    
    for(let data of rows){
        let arr = [data[0], ...data[1]]
        for(let i=1;i<arr.length;i++){
            arr[i] = arr[i] + "";
        }
        ans.push(arr)
    }

    return ans;
};
```
['Array', 'Hash Table', 'String', 'Sorting', 'Ordered Set', 'JavaScript']