Simple Python Solution Faster than 100%
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```\nclass Solution:\n    def rangeAddQueries(self, n: int, queries: List[List[int]]) -> List[List[int]]:\n        grid = [[0]*n for _ in range(n)]\n                \n        for row1,col1, row2, col2 in queries:\n            grid[row1][col1] += 1\n\n            if row2+ 1< n:\n                grid[row2+1][col1] -= 1\n            if col2 + 1 < n:\n                grid[row1][col2+1] -= 1\n\n            if row2 + 1 < n and col2 + 1< n:\n                grid[row2+1][col2+1] += 1\n\n        for i in range(1,n):\n            for j in range(n):\n                grid[i][j] += grid[i-1][j]\n        for i in range(n):\n            for j in range(1,n):\n                grid[i][j] += grid[i][j-1]\n        return grid\n```
['Python3']