From aa6f987ba720940d65697838bb656af16a799de7 Mon Sep 17 00:00:00 2001
From: AnkitDua123 <dua.ankit8@gmail.com>
Date: Mon, 25 Oct 2021 20:55:53 +0530
Subject: [PATCH] Adding TrappingRainWater solution

#hacktoberfest
---
 java-program/TrappingRainWater.java | 55 +++++++++++++++++++++++++++++
 1 file changed, 55 insertions(+)
 create mode 100644 java-program/TrappingRainWater.java

diff --git a/java-program/TrappingRainWater.java b/java-program/TrappingRainWater.java
new file mode 100644
index 0000000..bfa5dc7
--- /dev/null
+++ b/java-program/TrappingRainWater.java
@@ -0,0 +1,55 @@
+import java.io.*;
+import java.util.*;
+import java.lang.*;
+
+class TrappingRainWater{
+  public static void main(String[] args) throws IOException{
+    BufferReader br = new BufferedReader(new InputStreamReader(System.in));
+    int t = Integer.parseInt(br.readLine().trim());
+    int arr[] = new int[n];
+    while(t --> 0){
+      int n = Integer.parseInt(br.readLine().trim());
+      int arr[] = new int[n];
+      String inputLine[] = br.readLine().trim().split(" ");
+
+      for(int i=0;i<n;i++){
+        arr[i] = Integer.parseInt(inputLine[i]);
+      }
+      Solution obj = new Solution();
+      System.out.println(obj.trappingWater(arr,n));
+    }
+  }
+}
+
+
+class Solution{
+
+    static long trappingWater(int arr[], int n) { 
+        int len = arr.length;
+        int[] leftArr = new int[len];
+        int[] rightArr = new int[len];
+        int max = Integer.MIN_VALUE;
+        for(int i=0; i<len; i++){
+            if(max < arr[i]){
+                max = arr[i];
+            }
+            leftArr[i] = max;
+        }
+
+        max = Integer.MIN_VALUE;
+        for(int i=len-1; i>=0; i--){
+            if(max < arr[i]){
+                max = arr[i];
+            }
+            rightArr[i] = max;
+        }
+
+        long totalWater = 0;
+
+        for(int i=0; i<len; i++){
+            totalWater += Math.min(leftArr[i],rightArr[i]) - arr[i];
+        }
+
+        return totalWater;
+    } 
+}