Solution: Contains Duplicate (easy)

I did this at first, but when looking at the solution I saw the point of the exercise.

sset = set(nums)
return False if len(sset) == len(nums) else True

I just found another solution using Set(): by copying each element into a new set. Since a set only stores distinct elements, if the number of elements in the input matches the size of the Set, it means there are no duplicates

function containsDuplicate(nums) {
    if(!nums || nums.length == 0){
      return false;
    }
    
    let nums_copy = new Set();

    for(let i = 0; i<nums.length;i++){
      nums_copy.add(nums[i]);
    }

    return nums_copy.size == nums.length ? false:true;
  }
 

Is there a reason why this would not be a good solution? Maybe I am overlooking something here

const uniqueSet = new Set(nums);

if (uniqueSet.size !== nums.length) {
	return true; 
}

The problem didnt call for an item not found in the set to be added into the set.

The problem simply states to return if the set contains duplicates or not. This is very weird to me.

I appreciate that 3 example solutions are given but they are not given in order from least to most optimal. It would be nice to at least callout which solution for problems is the most optimal solution.

in the article you wrote set.count(x), set doesn't have a count method

The count operation on a HashSet does not make sense. Please check this line -

set.count(x) also has an average time complexity of O(1)."

I'm confused why would the worst case scenario for approach 2 be O(n^2) when using a Set in JavaScript since if the number already exists in the set, the add operation would just be ignored and the code would just early return true? So shouldn't the worst case scenario for approach 2 still be O(n)?

The explanation uses the variable name 'unique_set' but in the Java code solution it is called just 'set'.

def containsDuplicate(nums):
    for i in range(len(nums)):
      if nums[i] in nums[1+i:]:
        return True
    return False