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.

Example 1:

Input: nums = [1,2,3,1]
Output: true

Example 2:

Input: nums = [1,2,3,4]
Output: false

Example 3:

Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true

Constraints:

• 1 <= nums.length <= 105
• -109 <= nums[i] <= 109

SOLUTION:

import heapq

class Solution:
    def containsDuplicate(self, nums: List[int]) -> bool:
        n = len(nums)
        heapq.heapify(nums)
        curr = heapq.heappop(nums)
        for _ in range(n - 1):
            currnew = heapq.heappop(nums)
            if curr == currnew:
                return True
            curr = currnew
        return False