Arrays & hashingLeetCode 217

Lesson 51 of 76

Contains Duplicate

Decide whether any value appears at least twice in an array.

Watch on YouTube

Lesson notes

Try it before you watch

Restate the problem in your own words, list the edge cases, and sketch a solution with its running time. Then play the video and compare.

Reveal the key idea

Add values to a set and stop at the first value that is already present.

Pattern: Arrays & hashing. Trade memory for speed: sets and dictionaries answer 'have I seen this?' in O(1).

Complexity

Cost of the standard optimal approach for Contains Duplicate
Measure Bound
Time O(n)
Extra space O(n)

Walkthroughs often start from a simpler approach first; aim to reach these bounds. New to Big-O? Read understanding algorithmic complexity.