Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
professoretc
on Nov 14, 2023
|
parent
|
context
|
favorite
| on:
My favorite coding question to give candidates
I've heard O(n²) described as the most
dangerous
asymptotic complexity, because it seems fine for small testing inputs but falls down when you throw real-world -sized data at it.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: