From bed0b14956610aacb7e00757df0cfc7b7e300799 Mon Sep 17 00:00:00 2001
From: Rohit <root1@Mac.local>
Date: Mon, 20 Apr 2026 16:32:48 +0530
Subject: [PATCH 1/3] Added JournalApp Project

---
 Projects/JournalApp | 1 +
 1 file changed, 1 insertion(+)
 create mode 160000 Projects/JournalApp

diff --git a/Projects/JournalApp b/Projects/JournalApp
new file mode 160000
index 00000000..1136627a
--- /dev/null
+++ b/Projects/JournalApp
@@ -0,0 +1 @@
+Subproject commit 1136627ac360a4bcec3024616b04bf99562750b7

From db11496646142af3ab8dc84b872f22e3dac01676 Mon Sep 17 00:00:00 2001
From: Rohit <rohitbishtt69@gmail.com>
Date: Wed, 22 Apr 2026 07:43:23 +0530
Subject: [PATCH 2/3] NextGreaterElement GFG Question Using Stack

---
 .../Algorithms/Stack/nextGreaterElement.java  | 54 +++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 Projects/Algorithms/Stack/nextGreaterElement.java

diff --git a/Projects/Algorithms/Stack/nextGreaterElement.java b/Projects/Algorithms/Stack/nextGreaterElement.java
new file mode 100644
index 00000000..a96e1147
--- /dev/null
+++ b/Projects/Algorithms/Stack/nextGreaterElement.java
@@ -0,0 +1,54 @@
+import java.util.*;
+
+public class NextGreaterElement {
+
+    /**
+     * Function to find Next Greater Element for each element in the array.
+     *
+     * @param arr Input array of integers
+     * @return Array containing next greater elements
+     */
+    public static int[] findNextGreater(int[] arr) {
+        int n = arr.length;
+        int[] result = new int[n];
+
+        // Stack to store elements
+        Stack<Integer> stack = new Stack<>();
+
+        // Traverse from right to left
+        for (int i = n - 1; i >= 0; i--) {
+
+            // Remove elements from stack that are <= current element
+            while (!stack.isEmpty() && stack.peek() <= arr[i]) {
+                stack.pop();
+            }
+
+            // If stack is empty, no greater element exists
+            if (stack.isEmpty()) {
+                result[i] = -1;
+            } else {
+                // Top of stack is the next greater element
+                result[i] = stack.peek();
+            }
+
+            // Push current element onto stack
+            stack.push(arr[i]);
+        }
+
+        return result;
+    }
+
+    /**
+     * Driver method to test the function
+     */
+    public static void main(String[] args) {
+        int[] arr = {4, 5, 2, 10, 8};
+
+        int[] result = findNextGreater(arr);
+
+        System.out.println("Next Greater Elements:");
+        for (int num : result) {
+            System.out.print(num + " ");
+        }
+    }
+}

From a26ad111f0eecbbbbd8c188ec92ec0d87b1e0ed1 Mon Sep 17 00:00:00 2001
From: Rohit <rohitbishtt69@gmail.com>
Date: Sun, 26 Apr 2026 18:58:30 +0530
Subject: [PATCH 3/3] Added Pyramid Pattern

---
 Projects/Patterns/pyramidPattern.java | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 Projects/Patterns/pyramidPattern.java

diff --git a/Projects/Patterns/pyramidPattern.java b/Projects/Patterns/pyramidPattern.java
new file mode 100644
index 00000000..2e6dda94
--- /dev/null
+++ b/Projects/Patterns/pyramidPattern.java
@@ -0,0 +1,21 @@
+public class PyramidPattern {
+    public static void main(String[] args) {
+        int n = 5; // number of rows
+
+        for (int i = 1; i <= n; i++) {
+
+            // print spaces
+            for (int j = 1; j <= n - i; j++) {
+                System.out.print(" ");
+            }
+
+            // print stars
+            for (int j = 1; j <= i; j++) {
+                System.out.print("* ");
+            }
+
+            // move to next line
+            System.out.println();
+        }
+    }
+}