C++ || Prefix Sum || Short and Concise
```\nclass Solution {\npublic:\n    vector> rangeAddQueries(int n, vector>& queries) {\n        vector> arr(n, vector (n, 0));\n        for(auto query : queries
```\nclass Solution {\npublic:\n    vector<vector<int>> rangeAddQueries(int n, vector<vector<int>>& queries) {\n        vector<vector<int>> arr(n, vector<int> (n, 0));\n        for(auto query : queries){\n            int r1 = query[0], r2 = query[2];\n            int c1 = query[1], c2 = query[3];\n            arr[r1][c1] += 1;\n            if(c2 + 1 < n) arr[r1][c2 + 1]--;\n            if(r2 + 1 < n) arr[r2 + 1][c1]--;\n            if(r2 + 1 < n and c2 + 1 < n) arr[r2 + 1][c2 + 1]++;\n        }\n        for(int i = 0; i < n; i++){\n            for(int j = 0; j < n; j++){\n                if(i == 0 and j == 0) continue;\n                else if(i == 0) arr[i][j] += arr[i][j - 1];\n                else if(j == 0) arr[i][j] += arr[i - 1][j];\n                else arr[i][j] += arr[i - 1][j] + arr[i][j - 1] - arr[i - 1][j - 1]; \n            }\n        }\n        return arr;\n    }\n};
['C', 'Prefix Sum']