From 8b7cf19ef76cdce2ee18bbbd76505f282dd498e9 Mon Sep 17 00:00:00 2001
From: Tanmay-312 <jain2002tj@gmail.com>
Date: Mon, 29 Jan 2024 12:01:27 +0530
Subject: [PATCH] Added codes for 29 Jan

---
 GeeksForGeeks/January/29-1-24/GFG.java  | 66 +++++++++++++++++++++++++
 GeeksForGeeks/January/29-1-24/README.md |  2 +
 LeetCode/January/29-1-24/README.md      |  2 +
 LeetCode/January/29-1-24/Solution.java  | 30 +++++++++++
 4 files changed, 100 insertions(+)
 create mode 100644 GeeksForGeeks/January/29-1-24/GFG.java
 create mode 100644 GeeksForGeeks/January/29-1-24/README.md
 create mode 100644 LeetCode/January/29-1-24/README.md
 create mode 100644 LeetCode/January/29-1-24/Solution.java

diff --git a/GeeksForGeeks/January/29-1-24/GFG.java b/GeeksForGeeks/January/29-1-24/GFG.java
new file mode 100644
index 0000000..5f718b6
--- /dev/null
+++ b/GeeksForGeeks/January/29-1-24/GFG.java
@@ -0,0 +1,66 @@
+//{ Driver Code Starts
+//Initial Template for Java
+
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+class GFG
+{
+    public static void main(String[] args) throws IOException
+    {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int T = Integer.parseInt(br.readLine().trim());
+        while(T-->0)
+        {
+            String str = br.readLine().trim();
+            Solution ob = new Solution();
+            int ans = ob.TotalCount(str);
+            System.out.println(ans);           
+        }
+    }
+}
+
+// } Driver Code Ends
+
+
+//User function Template for Java
+
+class Solution
+{
+    public int TotalCount(String str)
+    {
+        // Code here
+        int i,j,sum=0,ans =1,n = str.length();
+        int[][] sums = new int[n][n];
+       
+        for(i=0;i<n;i++)
+        {
+           for(j=i;j<n;j++)
+           {
+               if(i==j)
+                   sums[i][j] = str.charAt(j)-'0';
+               else
+                   sums[i][j] = sums[i][j-1]+ (str.charAt(j)-'0');
+           }
+       }
+       
+       int[][] dp = new int[n][n];
+       
+       Arrays.fill(dp[0],1);
+       for(i=1;i<n;i++)
+       {
+           for(j=i;j<n;j++)
+           {
+               for(int k=0;k<=i-1;k++)
+               {
+                   if(sums[k][i-1] <= sums[i][j])
+                       dp[i][j] += dp[k][i-1]; 
+               }
+               
+           }
+           ans += dp[i][n-1];
+       }
+       
+       return ans;
+    }
+}
diff --git a/GeeksForGeeks/January/29-1-24/README.md b/GeeksForGeeks/January/29-1-24/README.md
new file mode 100644
index 0000000..7aae792
--- /dev/null
+++ b/GeeksForGeeks/January/29-1-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n^3)
+Space complexity - O(n^2)
diff --git a/LeetCode/January/29-1-24/README.md b/LeetCode/January/29-1-24/README.md
new file mode 100644
index 0000000..9aa6d98
--- /dev/null
+++ b/LeetCode/January/29-1-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(1) and O(n)
+Space complexity - O(n)
diff --git a/LeetCode/January/29-1-24/Solution.java b/LeetCode/January/29-1-24/Solution.java
new file mode 100644
index 0000000..afacf73
--- /dev/null
+++ b/LeetCode/January/29-1-24/Solution.java
@@ -0,0 +1,30 @@
+class MyQueue 
+{
+    public void push(int x) 
+    {
+        input.push(x);
+    }
+
+    public int pop() 
+    {
+        peek();
+        return output.pop();
+    }
+
+    public int peek() 
+    {
+        if (output.isEmpty())
+            while (!input.isEmpty())
+                output.push(input.pop());
+        
+        return output.peek();
+    }
+
+    public boolean empty() 
+    {
+        return input.isEmpty() && output.isEmpty();
+    }
+
+    private Deque<Integer> input = new ArrayDeque<>();
+    private Deque<Integer> output = new ArrayDeque<>();
+}