JavaScript simple brute force solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * @param {number} n\n * @param {number[][]} queries\n * @return {number[][]}\n */\nvar rangeAddQueries = function(n, queries) {\n    let matrix = new Array(n);\n\nfor (let i = 0; i < matrix.length; i++) {\n  matrix[i] = new Array(n).fill(0)\n}\n\n    \n    let add=(x1,y1,x2,y2)=>{\n        for(let i=x1;i<=x2;i++){\n            for(let j=y1;j<=y2;j++){\n            matrix[i][j]+=1\n\n        }\n        }\n    }\n    for(let k=0;k<queries.length;k++){\n        add(queries[k][0],queries[k][1],queries[k][2],queries[k][3])\n    }\n    return matrix\n    \n};\n```
['JavaScript']