News for hackers. Stuff that matters.
Re:How to Ace the Google Interview: Ultimate Guide by zepolen on Tuesday April 23, 2019 @09:40PM (#19734817)
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.

There are no comments on this comment yet.