219. Contains Duplicate II
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 <= 105-109 <= nums[i] <= 1090 <= k <= 105
Asked at 15 companies
TCS
GoogleTopics
Loading editor…
1class Solution:
2 def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
3
Starter codePython 3Spaces: 4
Loading editor…
1class Solution:
2 def containsNearbyDuplicate(self, nums: List[int], k: int) -> bool:
3
Starter codePython 3Spaces: 4
Examples
Input
[1,2,3,1] 3
Input
[1,0,1,1] 1
Input
[1,2,3,1,2,3] 2
Your code is saved on this device.Solution