From a8139f96dfe3f79b170c151492d2038a4d89d129 Mon Sep 17 00:00:00 2001
From: Gaurav Bisen <133369259+gauravbisen1@users.noreply.github.com>
Date: Sat, 25 Oct 2025 12:32:03 +0530
Subject: [PATCH] Implement trapped water calculation algorithm

---
 .../searches/trapingeainwatter.java           | 33 +++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 src/main/java/com/thealgorithms/searches/trapingeainwatter.java

diff --git a/src/main/java/com/thealgorithms/searches/trapingeainwatter.java b/src/main/java/com/thealgorithms/searches/trapingeainwatter.java
new file mode 100644
index 000000000000..df5392a7a9c0
--- /dev/null
+++ b/src/main/java/com/thealgorithms/searches/trapingeainwatter.java
@@ -0,0 +1,33 @@
+public class trappedWater{
+    public static int trappedWater(int height[]){
+        int n = height.length;
+
+        //calculate left max boundary - array
+        int leftMax[] = new int[n];
+        leftMax[0] = height[0];
+        for (int i = 1; i < n; i++) {
+            leftMax[i] = Math.max(height[i], leftMax[i-1]);
+        }
+
+        //calculate right max boundary - array
+        int rightMax[] = new int[n];
+        rightMax[n-1] = height[n-1];
+        for (int i = n-2; i >= 0; i--) {
+            rightMax[i] = Math.max(height[i], rightMax[i+1]);
+        }
+
+        int trappedWater = 0;
+        //loop ->
+        for (int i = 0; i < n; i++) {
+        //water level = min(leftMaxBoundary , rightMaxBoundary)
+            int waterlevel = Math.min(leftMax[i], rightMax[i]);
+        //trappedWater = waterlevel - height[i]
+            trappedWater = trappedWater + waterlevel - height[i];
+        }
+        return trappedWater;
+    }
+    public static void main(String[] args) {
+        int height[] = {4,2,0,6,3,2,5};
+        System.out.println(trappedWater(height));
+    }
+}