From 849296f42ad38d7a7966871891757a1bd1a0c927 Mon Sep 17 00:00:00 2001
From: Saurabh Kumar <75939984+saurabhkumar1432@users.noreply.github.com>
Date: Sun, 2 Oct 2022 01:34:20 +0530
Subject: [PATCH] maximum rectangle sum

---
 .../rectangle sum.cpp                         | 68 +++++++++++++++++++
 1 file changed, 68 insertions(+)
 create mode 100644 Program's_Contributed_By_Contributors/rectangle sum.cpp

diff --git a/Program's_Contributed_By_Contributors/rectangle sum.cpp b/Program's_Contributed_By_Contributors/rectangle sum.cpp
new file mode 100644
index 0000000000..0e86c5f440
--- /dev/null
+++ b/Program's_Contributed_By_Contributors/rectangle sum.cpp	
@@ -0,0 +1,68 @@
+//saurabh kumar
+//https://github.com/saurabhkumar1432
+//date-1 october 2022 
+//time - 00:26
+class Solution {
+public:
+    int maxSumSubmatrix(vector<vector<int>>& matrix, int k) {
+         int m=matrix.size(),n=matrix[0].size();
+        vector<vector<int>>dp(m+1,vector<int>(n,0));
+        for(int i=0;i<m;i++){
+            for(int j=0;j<n;j++){
+                dp[i+1][j]=dp[i][j]+matrix[i][j];
+            }
+        }
+        int ans=INT_MIN;
+        for(int i=0;i<m;i++){
+            for(int l=i+1;l<=m;l++){
+                for(int j=0;j<n;j++){
+                    int val=0;
+                    for(int k=j;k<n;k++){
+                        val+=dp[l][k]-dp[i][k];
+                        
+                        if(val<k){
+                            ans=max(ans,val);
+                        }
+                        else if(val==k){
+                            return k;
+                        }
+                    }
+                }
+            }
+        }
+        return ans;
+    
+    }
+};
+class Solution {
+public:
+    int maxSumSubmatrix(vector<vector<int>>& matrix, int k) {
+         int m=matrix.size(),n=matrix[0].size();
+        vector<vector<int>>dp(m+1,vector<int>(n,0));
+        for(int i=0;i<m;i++){
+            for(int j=0;j<n;j++){
+                dp[i+1][j]=dp[i][j]+matrix[i][j];
+            }
+        }
+        int ans=INT_MIN;
+        for(int i=0;i<m;i++){
+            for(int l=i+1;l<=m;l++){
+                for(int j=0;j<n;j++){
+                    int val=0;
+                    for(int k=j;k<n;k++){
+                        val+=dp[l][k]-dp[i][k];
+                        
+                        if(val<k){
+                            ans=max(ans,val);
+                        }
+                        else if(val==k){
+                            return k;
+                        }
+                    }
+                }
+            }
+        }
+        return ans;
+    
+    }
+};
\ No newline at end of file