**Problem Statement:**
Given an integer array `nums`, return `true` if any value appears at least twice in the array, and return `false` if every element is distinct.
**Hint / Expected Approach:**
Hash set for O(n) detection
**Edge Cases to Consider:**
- (1) Single-element array
- (2) All duplicates
- (3) Large input with no duplicates