Detect Equal Values within an Index Radius

Quick Overview

Detect equal values within an inclusive index-distance limit using each value’s latest earlier position.

Detect Equal Values within an Index Radius

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: easy

Interview Round: Other

### Problem Return whether two different array positions hold equal values and are at most k indices apart. Both value equality and the index-distance bound must hold. ```cpp bool containsNearbyDuplicate(vector<int>& nums, int k); ``` ### Examples ```text Input: nums = [3,8,3], k = 2 Output: true ``` ```text Input: nums = [3,8,3], k = 1 Output: false ``` ### Constraints - Length is between 1 and 100000. - Values lie between -1000000000 and 1000000000. - `0 <= k <= 100000`.

Overview: Detect equal values within an inclusive index-distance limit using each value’s latest earlier position.

Google logo
Google
Source window: 0–3 months · as of Oct 21, 2026
easySoftware EngineerOtherCoding & Algorithms
0
0

Problem

Return whether two different array positions hold equal values and are at most k indices apart. Both value equality and the index-distance bound must hold.

bool containsNearbyDuplicate(vector<int>& nums, int k);

Examples

Input: nums = [3,8,3], k = 2
Output: true
Input: nums = [3,8,3], k = 1
Output: false

Constraints

  • Length is between 1 and 100000.
  • Values lie between -1000000000 and 1000000000.
  • 0 <= k <= 100000 .