HacktoberFest
HacktoberFest copied to clipboard
Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Example: Input: height = [0,1,0,2,1,0,1,3,2,1,2,1] Output: 6
Can I work on this issue
Hi @tarunsinghofficial , I know how to solve Trapping Rain Water problem. Kindly please assign me this issue.
I would like to contribute on this issues please assigned it to me @tarunsinghofficial
I will be able to contribute in this issues please assign it to me .? @tarunsinghofficial
Hi @tarunsinghofficial Please Assign me this issue I will solve it in Optimized way.
trapping Rainwater ZIP.zip hey @tarunsinghofficial here is the solution of this issue , I attached the zip file you can check it out. please assign me this so that I can send you a pull request.
Hello @tarunsinghofficial @harshita9621 , I would like to work on this issue, Ill be happy to comments after each part too. Please assign it to me.
Hiii @tarunsinghofficial Please assign me ,I will solve this problem in two ways.
hello .please assign this to me I can do it.
hello @tarunsinghofficial please Assign me this issue i will solve in most effective way
I would like to contribute to this project.Please assign me this project.I will complete this project in just one day by using comments,appropriate variable names and in most efficient way.Greatly looking ahead to work with you.