219. Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indicesi and j in the array such that nums[i] = nums[j] and theabsolute difference between i and j is at mostk.

Subscribe to see which companies asked this question.

Solution:

Tips:

map, set

Java Code:

public class Solution {    public boolean containsNearbyDuplicate(int[] nums, int k) {        Map<Integer, Integer> mii = new HashMap<>();                for (int i = 0; i < nums.length; i++) {            if (mii.containsKey(nums[i]) && i - mii.get(nums[i]) <= k) {                return true;            }            mii.put(nums[i], i);        }                return false;    }}