Simple and Easy JAVA Solution , Brute Force Approach
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```java []\nclass Solution {\n    public int[][] rangeAddQueries(int n, int[][] queries) {\n        int mat[][] = new int[n][n];\n\n        for(int arr[] : queries){\n            int sR = arr[0];\n            int sC = arr[1];\n            int eR = arr[2];\n            int eC = arr[3];\n            for(int r = sR ; r <= eR ; r++){\n                for(int c = sC ; c <= eC ; c++){\n                    ++mat[r][c];\n                }\n            }\n        }\n\n        return mat;\n    }\n}\n```
['Java']