Merge pull request #228 from kushal34712/patch-3

Create kushalaqud792

kushalaqud792

@@ -0,0 +1,43 @@
+/// help of squd 
+
+
+class Solution {
+public:
+    int maxDotProduct(vector<int>& nums1, vector<int>& nums2) {
+        int m = nums1.size();
+        int n = nums2.size();
+
+        // Initialize a 2D DP array to store the maximum dot product
+        vector<vector<int>> dp(m, vector<int>(n));
+
+        // Fill in the DP array
+        dp[0][0] = nums1[0] * nums2[0];
+        int max_product = dp[0][0];
+
+        for (int i = 1; i < m; i++) {
+            dp[i][0] = max(dp[i - 1][0], nums1[i] * nums2[0]);
+            max_product = max(max_product, dp[i][0]);
+        }
+
+        for (int j = 1; j < n; j++) {
+            dp[0][j] = max(dp[0][j - 1], nums1[0] * nums2[j]);
+            max_product = max(max_product, dp[0][j]);
+        }
+
+        for (int i = 1; i < m; i++) {
+            for (int j = 1; j < n; j++) {
+                dp[i][j] = max(nums1[i] * nums2[j], dp[i - 1][j - 1] + nums1[i] * nums2[j]);
+                dp[i][j] = max(dp[i][j], dp[i - 1][j]);
+                dp[i][j] = max(dp[i][j], dp[i][j - 1]);
+                max_product = max(max_product, dp[i][j]);
+            }
+        }
+
+        return max_product;
+    }
+};
+
+
+//Leetcode  POTD
+//CPP
+//8th Oct