Problem - Contains Duplicate

Given an integer array $nums$, return $true$ if any value appears at least twice in the array. Return $false$ if every element is distinct.

This problem has multiple solutions with different time complexities. Comparing them will reinforce your understanding of Big O analysis.