From bf613b6dbac2646bfa66b64ed241f80331d672b6 Mon Sep 17 00:00:00 2001
From: Tanmay-312 <jain2002tj@gmail.com>
Date: Sun, 7 Apr 2024 09:37:22 +0530
Subject: [PATCH] Added codes for 7 April

---
 GeeksForGeeks/April/07-4-24/GFG.java  | 49 +++++++++++++++++++++++++++
 GeeksForGeeks/April/07-4-24/README.md |  2 ++
 LeetCode/April/07-4-24/README.md      |  2 ++
 LeetCode/April/07-4-24/Solution.java  | 32 +++++++++++++++++
 4 files changed, 85 insertions(+)
 create mode 100644 GeeksForGeeks/April/07-4-24/GFG.java
 create mode 100644 GeeksForGeeks/April/07-4-24/README.md
 create mode 100644 LeetCode/April/07-4-24/README.md
 create mode 100644 LeetCode/April/07-4-24/Solution.java

diff --git a/GeeksForGeeks/April/07-4-24/GFG.java b/GeeksForGeeks/April/07-4-24/GFG.java
new file mode 100644
index 0000000..75730ea
--- /dev/null
+++ b/GeeksForGeeks/April/07-4-24/GFG.java
@@ -0,0 +1,49 @@
+//{ Driver Code Starts
+//Initial Template for Java
+
+import java.io.*;
+import java.util.*;
+class GfG
+{
+    public static void main(String args[])
+        {
+            Scanner sc = new Scanner(System.in);
+            int t = sc.nextInt();
+            while(t-->0)
+                {
+                    int n = sc.nextInt();
+                    int m = sc.nextInt();
+                    int a[] = new int[n];
+                    int b[] = new int[m];
+                    for(int i = 0;i<n;i++)
+                        a[i] = sc.nextInt();
+                    for(int i = 0;i<m;i++)
+                        b[i] = sc.nextInt();    
+                    Solution ob = new Solution();
+                    System.out.println(ob.maxDotProduct(n, m, a, b));
+                }
+        }
+}    
+// } Driver Code Ends
+
+
+//User function Template for Java
+
+class Solution
+{
+	public int maxDotProduct(int n, int m, int a[], int b[]) 
+	{ 
+		// Your code goes here
+		int[][] dp = new int[m + 1][n + 1];
+        
+        for (int i = 1; i <= m; i++) 
+        {
+            for (int j = i; j <= n; j++) 
+            {
+                dp[i][j] = Math.max(dp[i - 1][j - 1] + a[j - 1] * b[i - 1], dp[i][j - 1]);
+            }
+        }
+        
+        return dp[m][n];
+	} 
+}
diff --git a/GeeksForGeeks/April/07-4-24/README.md b/GeeksForGeeks/April/07-4-24/README.md
new file mode 100644
index 0000000..8faf6d9
--- /dev/null
+++ b/GeeksForGeeks/April/07-4-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n*m)
+Space complexity - O(n*m)
diff --git a/LeetCode/April/07-4-24/README.md b/LeetCode/April/07-4-24/README.md
new file mode 100644
index 0000000..9567f26
--- /dev/null
+++ b/LeetCode/April/07-4-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)
diff --git a/LeetCode/April/07-4-24/Solution.java b/LeetCode/April/07-4-24/Solution.java
new file mode 100644
index 0000000..f8c4216
--- /dev/null
+++ b/LeetCode/April/07-4-24/Solution.java
@@ -0,0 +1,32 @@
+class Solution 
+{
+    public boolean checkValidString(String s) 
+    {
+        int low = 0;
+        int high = 0;
+
+        for (char c : s.toCharArray()) 
+        {
+            switch (c) 
+            {
+                case '(':
+                    ++low;
+                    ++high;
+                    break;
+                case ')':
+                    low = Math.max(0, --low);
+                    --high;
+                    break;
+                case '*':
+                    low = Math.max(0, --low);
+                    ++high;
+                    break;
+            }
+            
+            if (high < 0)
+                return false;
+        }
+
+        return low == 0;
+    }
+}