Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
zepolen
on April 24, 2019
|
parent
|
context
|
favorite
| on:
How to Ace the Google Interview: Ultimate Guide
They didn't say it uses O(1) complexity:
> Analyzing the above approach, we have an algorithm that takes O(n) time and uses O(1) space.
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
> Analyzing the above approach, we have an algorithm that takes O(n) time and uses O(1) space.