Leetcode 219 Contains Duplicate 2
Leetcode 219: Contains Duplicate 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 […]
Leetcode 219 Contains Duplicate 2 Read More »
