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
Find the maximum amount of water that can be trapped within a given set of bars where each bar's width is 1 unit.
Ex - an array contain height of bars {7, 0, 4, 2, 5, 0, 6, 4, 0, 5}
Python
Arrays
No response
The text was updated successfully, but these errors were encountered:
Hello, I am contributing for Hacktoberfest 2021. Please assign me this issue.
Sorry, something went wrong.
Hi @anuraggarg010, can I do the same in JAVA?
Rronny01
Successfully merging a pull request may close this issue.
Description
Find the maximum amount of water that can be trapped within a given set of bars where each bar's width is 1 unit.
Ex - an array contain height of bars {7, 0, 4, 2, 5, 0, 6, 4, 0, 5}
Language
Python
Domain
Arrays
Type of Contribution
No response
Code of Conduct
The text was updated successfully, but these errors were encountered: