Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
chillee
on March 15, 2019
|
parent
|
context
|
favorite
| on:
Dynamic Programming for Technical Interviews
Well, A. Not exactly because there's no restrictions on when you can color nodes black, and B. Graph coloring in general is NP-complete while this problem has an O(n) solution.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
