2536. & java & 1 approach;
\n# Approach 1\n Describe your approach to solving the problem. \n\n# Complexity\n- Runtime : 1072 ms\n- Beats : 8.33%\n- Memory : 50.3 MB\n- Beats : 100%\n\n# 
\n# Approach 1\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Runtime : 1072 ms\n- Beats : 8.33%\n- Memory : 50.3 MB\n- Beats : 100%\n\n# Code\n```\nclass Solution {\n    public int[][] rangeAddQueries(int n, int[][] queries) {\n        int arr[][] = new int[n][n];\n        for(int i[] : queries){\n            while(i[0] <= i[2]){\n                int col = i[1];\n                while(col <= i[3]){\n                    arr[i[0]][col]++;\n                    col++;\n                }\n                i[0]++;\n            }\n        }\n        return arr;\n    }\n}\n```
['Java']