findDupe isn't O(1), it's O(n) since it has to look at all the elements in the l... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		nice_byte on March 8, 2016 \| parent \| context \| favorite \| on: How to Pass a Programming Interview findDupe isn't O(1), it's O(n) since it has to look at all the elements in the list.

quanticle on March 8, 2016 [–]

It's O(1) space complexity but O(n) time complexity.

nice_byte on March 8, 2016 | [–]

Oh sorry, that's right, I just assumed parent was referring to time.

Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact