GoLang Solution For LeetCode Problem: Contains Duplicate II
Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
Input: nums = [1,2,3,1], k = 3 Output: true
Input: nums = [1,0,1,1], k = 1 Output: true
Input: nums = [1,2,3,1,2,3], k = 2 Output: false
See the full details of the problem Contains Duplicate II at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go