Trapping Rain Water Problem ( LeetCode #42 ) Part-1 | FREE DSA Course in JAVA | Lecture 72

This is a popular Leetcode question asked in many product-based companies like Google, Facebook, and Salesforce.

The question reads out:-

Given n non negative integers representing an elevation map where the width of each bar is 1. Calculate how much water it can trap after raining.

So basically we have to find out how many units of water will be stored with the given arrangement of bars in form of an array.

There are certain observations you can make some base conditions

1. There should be minimum of three bars
2. Increasing bars will not store any water
3. Decreasing water will not store any water
4. 1st and last bar will not store any water

So you can use them to directly return 0 as the answer.

Check out the complete lecture to know the complete solution to the program to find the trapped rain water.

For more information, fill this form: https://forms.gle/8eiUmM92Fx563Aen9
or call us at 8884881203

Facebook:   / thetapacademy  

Instagram:  / tapacademy_online  

Linkedin:   / 73820805  

Website: https://www.thetapacademy.com​
#java #javaarray #array #arrayjava #javaprogramming #programming #programmer