Added codes for 7 April

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];
+	} 
+}

GeeksForGeeks/April/07-4-24/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n*m)
+Space complexity - O(n*m)

LeetCode/April/07-4-24/README.md

@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(1)

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;
+    }
+}