Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Deestan
on Oct 8, 2010
|
parent
|
context
|
favorite
| on:
Can you solve it? The Greplin programming challen...
Congratulations are in order, he sacrificed 400ms CPU time to save at least a few minutes of coding time.
cperciva
on Oct 8, 2010
[–]
I wasn't being entirely sarcastic. It never occurred to me that you could use a non-polynomial-time algorithm.
util
on Oct 11, 2010
|
parent
[–]
All the solutions posted here seem to involve generating all subsequences. Could you say more about your approach?
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
