1 DSA problems asked in Palantir coding interviews
1 Easy
0 Medium
0 Hard
All Categories
All
1 problem
Arrays & Hashing
1
Contains Duplicate II
Easy
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.