From a30d802f0dbd0fab4594af5e4e910fc0b14fa5d2 Mon Sep 17 00:00:00 2001
From: Tanmay-312 <jain2002tj@gmail.com>
Date: Sat, 15 Jun 2024 13:43:31 +0530
Subject: [PATCH] Added codes for 15 June

---
 GeeksForGeeks/June/15-6-24/GFG.java  | 51 ++++++++++++++++++++++++++++
 GeeksForGeeks/June/15-6-24/README.md |  2 ++
 LeetCode/June/15-6-24/README.md      |  2 ++
 LeetCode/June/15-6-24/Solution.java  | 35 +++++++++++++++++++
 4 files changed, 90 insertions(+)
 create mode 100644 GeeksForGeeks/June/15-6-24/GFG.java
 create mode 100644 GeeksForGeeks/June/15-6-24/README.md
 create mode 100644 LeetCode/June/15-6-24/README.md
 create mode 100644 LeetCode/June/15-6-24/Solution.java

diff --git a/GeeksForGeeks/June/15-6-24/GFG.java b/GeeksForGeeks/June/15-6-24/GFG.java
new file mode 100644
index 0000000..31f77ff
--- /dev/null
+++ b/GeeksForGeeks/June/15-6-24/GFG.java
@@ -0,0 +1,51 @@
+//{ 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();
+            Solution ob = new Solution();
+            System.out.println(ob.getCount(n));
+        }
+    }
+}
+// } Driver Code Ends
+
+
+// User function Template for Java
+
+class Solution {
+    public long getCount(int n) {
+        // Your code goes here
+        long[][] dp = new long[n][10];
+        for(int i=0;i<10;i++)
+        {
+            dp[0][i] = 1;
+        }
+        for(int i=1;i<n;i++)
+        {
+            dp[i][0] = dp[i-1][0]+dp[i-1][8];
+            dp[i][1] = dp[i-1][1]+dp[i-1][2]+dp[i-1][4];
+            dp[i][2] = dp[i-1][2]+dp[i-1][3]+dp[i-1][1]+dp[i-1][5];
+            dp[i][3] = dp[i-1][2]+dp[i-1][6]+dp[i-1][3];
+            dp[i][4] = dp[i-1][1]+dp[i-1][5]+dp[i-1][7]+dp[i-1][4];
+            dp[i][5] = dp[i-1][2]+dp[i-1][4]+dp[i-1][6]+dp[i-1][8]+dp[i-1][5];
+            dp[i][6] = dp[i-1][3]+dp[i-1][5]+dp[i-1][6]+dp[i-1][9];
+            dp[i][7] = dp[i-1][4]+dp[i-1][7]+dp[i-1][8];
+            dp[i][8] = dp[i-1][5]+dp[i-1][7]+dp[i-1][8]+dp[i-1][0]+dp[i-1][9];
+            dp[i][9] = dp[i-1][9]+dp[i-1][8]+dp[i-1][6];
+        }
+        long sum = 0;
+        for(int i=0;i<10;i++)
+        {
+            sum = sum+dp[n-1][i];
+        }
+        return sum;
+    }
+}
diff --git a/GeeksForGeeks/June/15-6-24/README.md b/GeeksForGeeks/June/15-6-24/README.md
new file mode 100644
index 0000000..7384c4b
--- /dev/null
+++ b/GeeksForGeeks/June/15-6-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n)
+Space complexity - O(n)
diff --git a/LeetCode/June/15-6-24/README.md b/LeetCode/June/15-6-24/README.md
new file mode 100644
index 0000000..905c94b
--- /dev/null
+++ b/LeetCode/June/15-6-24/README.md
@@ -0,0 +1,2 @@
+Time complexity - O(n*logn)
+Space complexity - O(n)
diff --git a/LeetCode/June/15-6-24/Solution.java b/LeetCode/June/15-6-24/Solution.java
new file mode 100644
index 0000000..de547e8
--- /dev/null
+++ b/LeetCode/June/15-6-24/Solution.java
@@ -0,0 +1,35 @@
+class T
+{
+    public int pro;
+    public int cap;
+    public T(int pro, int cap)
+    {
+        this.pro = pro;
+        this.cap = cap;
+    }
+}
+
+class Solution
+{
+    public int findMaximizedCapital(int k, int W, int[] Profits, int[] Capital)
+    {
+        Queue<T> minHeap = new PriorityQueue<>((a, b) -> a.cap - b.cap);
+        Queue<T> maxHeap = new PriorityQueue<>((a, b) -> b.pro - a.pro);
+
+        for (int i = 0; i < Capital.length; ++i)
+            minHeap.offer(new T(Profits[i], Capital[i]));
+
+        while (k-- > 0)
+        {
+            while (!minHeap.isEmpty() && minHeap.peek().cap <= W)
+                maxHeap.offer(minHeap.poll());
+            
+            if (maxHeap.isEmpty())
+                break;
+            
+            W += maxHeap.poll().pro;
+        }
+
+        return W;
+    }
+}