Skip to content

problem5.md

Latest commit

 

History

History
12 lines (9 loc) · 392 Bytes

problem5.md

File metadata and controls

12 lines (9 loc) · 392 Bytes

Problem 5: Proximity Constraint (Contains Duplicate II)

Problem Statement

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 array of integers nums.
  • An integer k.

Example

Input: nums = [1, 2, 3, 1], k = 3
Output: True