Closed YashGosaliya closed 2 years ago
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.
https://leetcode.com/problems/trapping-rain-water/
Dynamic Programming, Array
@SarthakKeshari please assign this issue
@YashGosaliya, Go ahead, add your solution to "leetcode" folder. Deadline - 21/10/2021
plz assign it to me @SarthakKeshari
Enter your question -
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.
Enter link to the question(if question belongs to any online platform) -
https://leetcode.com/problems/trapping-rain-water/
Tags for the question(eg - Array, Basic, Stack, etc.) -
Dynamic Programming, Array