Contains Duplicate II · Interview Problem

Back to problems

Leetcode

contains-duplicate-ii

Medium

Arrays

Sliding Window

Hash Table

Contains Duplicate II

Check if the array contains duplicates such that the indices of the duplicate elements are at most k apart.

Acceptance 100%

Start Practice Editorial

Problem Statement

Core description from the backend problem record.

Description

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.

Input Format

An integer array nums and an integer k.

Output Format

Boolean value true if such elements exist, otherwise false.

Constraints

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

Loading Preptin

Description

Input Format

Output Format

Constraints