def removeDuplicates(nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        # Use a two-pointer approach
        unique_index = 0
        
        # Utilize a set for faster lookup
        unique_set = set()
        
        for num in nums:
                if num not in unique_set:
                        nums[unique_index] = num
                        print(unique_set)
                        unique_index += 1
                        unique_set.add(num)
        return len(unique_set)

        # Faster runtime
        nums[:] = sorted(set(nums))
        return len(nums)
removeDuplicates([0,0,1,1,1,2,2,3,3,4])