Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.
The key is to keep updating hash table when duplicate is met.
Round 2 solution:
No comments:
Post a Comment