✅Accepted| | ✅Easy solution || ✅Short & Simple || ✅Best Method
\n# Code\n\nclass Solution {\npublic:\n    vector<vector<int>> rangeAddQueries(int n, vector<vector<int>>& queries) {\n        vector<vector<int>> dp(n, vector<
\n# Code\n```\nclass Solution {\npublic:\n    vector<vector<int>> rangeAddQueries(int n, vector<vector<int>>& queries) {\n        vector<vector<int>> dp(n, vector<int>(n));\n        for(vector<int> v:queries)\n        {\n            for(int i=v[0];i<=v[2];i++)\n            {\n                dp[i][v[1]]+=1;\n                if(v[3]<n-1)\n                dp[i][v[3]+1]-=1;\n            }\n        }\n        for(int i=0;i<n;i++)\n        {\n            for(int j=1;j<n;j++)\n            dp[i][j]+=dp[i][j-1];\n        }\n        return dp;\n    }\n};\n```\nPlease **UPVOTE** if it helps \u2764\uFE0F\uD83D\uDE0A\nThank You and Happy To Help You!!
['C++']