4 ms·
This is all fine and dandy but let’s be real. How many of you can solve: Given n non-negative integers representing an elevation map where the width of each bar
by robbywashere_ 8y ago
This is all fine and dandy but let’s be real. How many of you can solve:
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
In N(1) space and N time
- joppy 8y agoNone, because a two-dimensional bar graph can’t trap any water? This is completely irrelevant to the article being discussed.