3 ms·findDupe isn't O(1), it's O(n) since it has to look at all the elements in the list.by nice_byte 11y agofindDupe isn't O(1), it's O(n) since it has to look at all the elements in the list.quanticle 11y agoIt's O(1) space complexity but O(n) time complexity.nice_byte 11y agoOh sorry, that's right, I just assumed parent was referring to time.