[LeetCode] 0219. Contains Duplicate II

/ Leetcode, Technical Article / By

Explore diverse LeetCode solutions in Python, C++, JavaScript, SQL, and TypeScript. Ideal for interview prep, learning, and code practice in multiple programming languages. Github Repo Link

Table of contents

Easy

 

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

Example 1:

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

Example 2:

Input: nums = [1,0,1,1], k = 1
Output: true

Example 3:

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

Constraints:

  • 1 <= nums.length <= 10 5
  • -10 9 <= nums[i] <= 10 9
  • 0 <= k <= 10 5

Python

				
					# time complexity: O(n) # space complexity: O(min(n,k)) from typing import List class Solution: def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool: dic = {} for i, j in enumerate(nums): if j in dic and i - dic[j] <= k: return True dic[j] = i return False nums = [1, 2, 3, 1] k = 3 print(Solution().containsNearbyDuplicate(nums, k))

related articles