We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
AKSHITA has created an elevated roof. She wants to know how much water can she save during rain.
Given n non negative integers representing the elevation map where width of every bar is 1, Find the maximum water that she can save.
Explanation for the Sample input Testcase:
Elevation Map Input Format
First line contains an integer n. Second line contains n space separated integers representing the elevation map. Constraints
1 <= N <= 10^6 Output Format
Print a single integer containing the maximum unit of waters she can save. Sample Input
10 0 2 1 3 0 1 2 1 2 1
Sample Output
5
The text was updated successfully, but these errors were encountered:
ADD IN INTERVIEW QUESTION REPO
Sorry, something went wrong.
Can you assign this to me ?
assigning to u
Hi .. i have solved the issue . Kindly check
https://github.com/akshitagupta15june/interview-techdev-guide/pull/1
shiv-ani-singh
No branches or pull requests
AKSHITA has created an elevated roof. She wants to know how much water can she save during rain.
Given n non negative integers representing the elevation map where width of every bar is 1, Find the maximum water that she can save.
Explanation for the Sample input Testcase:
Elevation Map
Input Format
First line contains an integer n. Second line contains n space separated integers representing the elevation map.
Constraints
1 <= N <= 10^6
Output Format
Print a single integer containing the maximum unit of waters she can save.
Sample Input
10
0 2 1 3 0 1 2 1 2 1
Sample Output
5
The text was updated successfully, but these errors were encountered: