fullstackDevelopment
fullstackDevelopment copied to clipboard
[Problem]: Trapping rain water
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
- [X] I follow Contributing Guidelines & Code of conduct.
Hello, I am contributing for Hacktoberfest 2021. Please assign me this issue.
Hi @anuraggarg010, can I do the same in JAVA?