Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
_e4c8
on Nov 13, 2018
|
parent
|
context
|
favorite
| on:
The Dangerous Fetishization of ‘Hustle Porn’
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
on Nov 13, 2018
[–]
None, because a two-dimensional bar graph can’t trap any water?
This is
completely irrelevant
to the article being discussed.
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
In N(1) space and N time