Question: Given an unsorted array A of size n that may contain duplicates and a number k < n, design an O(n) algorithm that returns true
Given an unsorted array A of size n that may contain duplicates and a number k < n, design an O(n) algorithm that returns true if array contains duplicates within a distance of k, ie. i, j [0, n 1] such that A[i] = A[j] and |i j| < k.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
