diff --git a/Java/Arrays/TrappingRainWater.java b/Java/Arrays/TrappingRainWater.java
new file mode 100644
index 0000000..47de8ab
--- /dev/null
+++ b/Java/Arrays/TrappingRainWater.java
@@ -0,0 +1,45 @@
+import java.util.Scanner;
+
+class Solution {
+    public static int trap(int[] height) {
+        int n = height.length;
+        int res = 0;
+        int[] lmax = new int [n];
+        int[] rmax = new int [n];
+       lmax[0]=height[0];
+       for(int i = 1;i<n;i++){
+           lmax[i]=Math.max(height[i],lmax[i-1]);
+       }
+
+       rmax[n-1]=height[n-1];
+       for(int i=n-2;i>=0;i--){
+           rmax[i]=Math.max(height[i],rmax[i+1]);
+       }
+
+       for(int i =1;i<n-1;i++){
+           res = res+(Math.min(lmax[i],rmax[i])-height[i]);
+       }
+        return res;
+    }
+}
+public class TrappingRainWater {
+    public static void main(String args[]){
+        Scanner sc = new Scanner(System.in);
+
+        System.out.print("Enter the number of elements: ");
+        int n = sc.nextInt();
+
+        int[] height = new int[n];
+        System.out.println("Enter the elements of the array:");
+        for (int i = 0; i < n; i++) {
+            height[i] = sc.nextInt();
+        }
+
+        Solution solution = new Solution();
+        int trappedWater = solution.trap(height);
+
+        System.out.println("The amount of trapped rainwater is: " + trappedWater);
+
+        sc.close();
+    }
+}
diff --git a/Java/Searching/SearchInRotatedSortedArray.java b/Java/Searching/SearchInRotatedSortedArray.java
new file mode 100644
index 0000000..1d28fc7
--- /dev/null
+++ b/Java/Searching/SearchInRotatedSortedArray.java
@@ -0,0 +1,60 @@
+import java.util.Scanner;
+
+public class SearchInRotatedSortedArray {
+
+    public int search(int[] nums, int target) {
+        int n = nums.length;
+        int low = 0, high = n - 1;
+
+        while (low <= high) {
+            int mid = (low + high) / 2;
+
+            if (nums[mid] == target) {
+                return mid;
+            }
+
+            if (nums[low] <= nums[mid]) {
+                if (target >= nums[low] && target < nums[mid]) {
+                    high = mid - 1;
+                } else {
+                    low = mid + 1;
+                }
+            } else {
+                if (target > nums[mid] && target <= nums[high]) {
+                    low = mid + 1;
+                } else {
+                    high = mid - 1;
+                }
+            }
+        }
+
+        return -1;
+    }
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        SearchInRotatedSortedArray searchObj = new SearchInRotatedSortedArray();
+
+        System.out.print("Enter the number of elements in the rotated sorted array: ");
+        int n = scanner.nextInt();
+        int[] nums = new int[n];
+
+        System.out.println("Enter the elements of the rotated sorted array:");
+        for (int i = 0; i < n; i++) {
+            nums[i] = scanner.nextInt();
+        }
+
+        System.out.print("Enter the target element to search for: ");
+        int target = scanner.nextInt();
+
+        int result = searchObj.search(nums, target);
+
+        if (result != -1) {
+            System.out.println("Target element " + target + " is found at index " + result);
+        } else {
+            System.out.println("Target element " + target + " is not found in the array.");
+        }
+
+        scanner.close();
+    }
+}
\ No newline at end of file