TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Detecting Duplicates in O(1) Space and O(n) Time

9 pointsby jasondaviesover 12 years ago

1 comment

jrajavover 12 years ago
The more honest but less interesting subheader:<p><i>Given n integers 1 ≤ ai ≤ n - 1, can you detect duplicates in O(1) space and O(n) time?</i>