containsDuplicate = (nums) => {
    nums.sort((a, b) => a - b);/* Time O(N * log(N)) | Space O(1 || log(N)) */

    return hasDuplicate(nums);
}
Sort - HeapSort Space O(1) | QuickSort Space O(log(N))
Time O(N * log(N)) | Space O(1)
https://leetcode.com/problems/contains-duplicate/
@param {number[]} nums
@return {boolean}